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 listSep 6, 2026 10:45Kevin HeaveyKevin HeaveyScore: 3,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 10:463,58939,850,80328,751,0001,045,0002,113,536
2Sep 6, 2026 10:463,62640,128,12728,946,0001,156,0002,113,536
3Sep 6, 2026 10:463,78041,386,87130,231,0001,143,0002,113,536
4Sep 6, 2026 10:463,81541,673,88030,521,0001,147,0002,113,536
5Sep 6, 2026 10:463,85742,755,40830,849,0001,169,0002,113,536
6Sep 6, 2026 10:463,85842,059,52730,850,0001,175,0002,113,536
7Sep 6, 2026 10:463,87642,949,31331,129,0001,042,0002,113,536
8Sep 6, 2026 10:463,88442,353,73531,050,0001,190,0002,113,536
9Sep 6, 2026 10:463,89542,547,39631,285,0001,044,0002,113,536