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 14, 2026 10:39wnwnScore: 4,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2026 10:394,04562,660,66732,558,0001,017,0002,490,368
2Apr 14, 2026 10:404,05258,332,36232,611,0001,019,0002,490,368
3Apr 14, 2026 10:404,07658,415,62731,844,0001,990,0002,277,376
4Apr 14, 2026 10:394,08962,600,06431,943,0001,996,0002,490,368
5Apr 14, 2026 10:404,12654,632,55032,235,0002,014,0002,527,232
6Apr 14, 2026 10:394,19256,893,55933,774,0001,023,0002,277,376