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 listApr 21, 2026 15:39Charles CabergsCharles CabergsScore: 20,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 15:4020,325183,436,425165,709,0002,994,0002,338,816
2Apr 21, 2026 15:4020,328186,228,634165,728,0002,995,0002,514,944
3Apr 21, 2026 15:4020,330189,319,999165,749,0002,995,0002,519,040
4Apr 21, 2026 15:4020,338188,144,919165,813,0002,996,0002,523,136
5Apr 21, 2026 15:4020,346186,619,758165,876,0002,997,0002,519,040
6Apr 21, 2026 15:4020,352188,534,477165,927,0002,998,0002,510,848
7Apr 21, 2026 15:4020,859193,041,097171,132,0002,001,0002,523,136
8Apr 21, 2026 15:4020,917197,775,003170,624,0002,993,0002,330,624
9Apr 21, 2026 15:4020,927189,844,032170,704,0002,994,0002,519,040