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 25, 2026 20:30Maya RebholzMaya RebholzScore: 6,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 20:305,83360,527,83243,147,0005,268,0002,113,536
2May 25, 2026 20:305,91560,768,28443,705,0005,393,0002,117,632
3May 25, 2026 20:305,99459,703,39944,337,0005,421,0002,117,632
4May 25, 2026 20:306,01660,987,40544,449,0005,489,0002,117,632
5May 25, 2026 20:306,04461,688,25244,620,0005,550,0002,117,632
6May 25, 2026 20:306,06462,362,49444,630,0005,703,0002,117,632
7May 25, 2026 20:306,07562,763,76444,770,0005,653,0002,117,632
8May 25, 2026 20:306,09662,985,21644,982,0005,620,0002,117,632
9May 25, 2026 20:306,17563,237,56945,796,0005,458,0002,117,632