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 19:43Charles CabergsCharles CabergsScore: 20,015Success
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 19:4419,982187,820,908162,855,0002,997,0002,330,624stderr
2Apr 21, 2026 19:4419,990183,519,387162,920,0002,998,0002,506,752stderr
3Apr 21, 2026 19:4420,001185,862,952163,016,0003,000,0002,527,232stderr
4Apr 21, 2026 19:4420,009183,841,417163,077,0003,001,0002,510,848stderr
5Apr 21, 2026 19:4420,015185,644,686163,130,0003,002,0002,519,040stderr
6Apr 21, 2026 19:4420,017183,849,906163,147,0003,002,0002,510,848stderr
7Apr 21, 2026 19:4420,026185,888,871163,214,0003,003,0002,510,848stderr
8Apr 21, 2026 19:4420,027181,069,025164,227,0002,002,0002,531,328stderr
9Apr 21, 2026 19:4420,801191,929,596169,660,0002,994,0002,514,944stderr