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 07:11Charles CabergsCharles CabergsScore: 28,298Success
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 07:1128,273262,621,242231,679,0002,995,0002,265,088stderr
2Apr 21, 2026 07:1128,274261,335,801231,682,0002,995,0002,281,472stderr
3Apr 21, 2026 07:1128,289257,412,788231,806,0002,997,0002,498,560stderr
4Apr 21, 2026 07:1128,292256,555,220232,829,0001,998,0002,506,752stderr
5Apr 21, 2026 07:1128,298250,613,915232,869,0002,007,0002,519,040stderr
6Apr 21, 2026 07:1128,304258,083,204231,930,0002,999,0002,289,664stderr
7Apr 21, 2026 07:1128,313257,641,671232,002,0003,000,0002,260,992stderr
8Apr 21, 2026 07:1128,315255,700,862234,012,0001,004,0002,498,560stderr
9Apr 21, 2026 07:1128,320259,472,814232,060,0003,000,0002,498,560stderr