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 13, 2026 12:10wnwnScore: 4,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 12:104,09360,055,05831,971,0001,998,0002,277,376
2Apr 13, 2026 12:104,22459,309,08033,060,0002,003,0002,490,368
3Apr 13, 2026 12:104,32558,334,66233,902,0001,994,0002,277,376