Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listDec 19, 2025 20:10Zhalgas KhassenovZhalgas KhassenovScore: 1,673,541Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 19:141,669,71913,897,560,23213,756,737,000101,931,0002,347,008
2Dec 19, 2025 20:101,670,95713,910,168,86313,770,005,00098,935,0002,342,912
3Dec 22, 2025 19:141,671,61813,915,233,69413,783,477,00090,950,0002,347,008
4Dec 19, 2025 20:101,673,54113,929,389,10613,785,458,000104,934,0002,342,912
5Dec 22, 2025 19:141,695,00414,107,059,48213,956,615,000111,916,0002,473,984
6Dec 19, 2025 20:101,742,65914,499,845,40414,365,137,00098,932,0002,342,912