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 listFeb 21, 2026 23:03Mathaus Adorno PereiraMathaus Adorno PereiraScore: 218,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 23:03218,3231,838,360,6801,809,080,0002,998,0002,375,680
2Feb 21, 2026 23:03218,3291,832,728,0971,809,129,0002,998,0002,322,432
3Feb 21, 2026 23:03218,3771,833,204,1091,810,532,0001,999,0002,330,624
4Feb 21, 2026 23:03218,3781,839,695,1971,810,537,0001,999,0002,330,624
5Feb 21, 2026 23:03218,3901,840,197,5021,810,636,0001,999,0002,322,432
6Feb 21, 2026 23:03218,3911,846,050,6681,811,646,000999,0002,387,968
7Feb 21, 2026 23:03218,3941,836,267,7491,810,670,0001,999,0002,322,432
8Feb 21, 2026 23:03218,4371,842,333,8641,810,026,0002,998,0002,379,776
9Feb 21, 2026 23:03218,6521,848,273,3821,812,816,0001,999,0002,330,624