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 listMay 20, 2026 22:13Maya RebholzMaya RebholzScore: 9,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 22:149,45090,458,78176,266,0002,173,0002,113,536
2May 20, 2026 22:149,45587,892,08776,289,0002,192,0002,113,536
3May 20, 2026 22:149,45688,556,97776,322,0002,169,0002,113,536
4May 20, 2026 22:149,45889,905,51076,339,0002,165,0002,113,536
5May 20, 2026 22:149,46089,946,48076,307,0002,215,0002,113,536
6May 20, 2026 22:149,46190,386,45776,281,0002,250,0002,113,536
7May 20, 2026 22:149,46290,811,03676,332,0002,205,0002,113,536
8May 20, 2026 22:149,46691,084,24376,313,0002,256,0002,113,536
9May 20, 2026 22:149,46989,056,15176,368,0002,228,0002,113,536