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 listJul 12, 2026 14:00Kevin HeaveyKevin HeaveyScore: 3,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 14:013,94142,335,71831,504,0001,208,0002,117,632
2Jul 12, 2026 14:013,95242,388,75731,760,0001,042,0002,117,632
3Jul 12, 2026 14:013,95642,541,28731,603,0001,238,0002,117,632
4Jul 12, 2026 14:013,96442,518,15731,866,0001,042,0002,117,632
5Jul 12, 2026 14:013,97042,651,53631,910,0001,041,0002,117,632
6Jul 12, 2026 14:013,99042,732,15932,101,0001,020,0002,117,632
7Jul 12, 2026 14:014,06743,435,17232,717,0001,041,0002,117,632
8Jul 12, 2026 14:014,06743,390,37132,537,0001,224,0002,117,632
9Jul 12, 2026 14:014,10343,710,40533,016,0001,043,0002,117,632