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 listAug 11, 2026 00:54Victor MerckléVictor MerckléScore: 3,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 00:553,85241,063,32730,758,0001,214,0002,117,632stderr
2Aug 11, 2026 00:553,86040,933,63730,840,0001,199,0002,117,632stderr
3Aug 11, 2026 00:553,87640,533,39931,157,0001,016,0002,117,632stderr
4Aug 11, 2026 00:553,88940,696,20831,075,0001,205,0002,117,632stderr
5Aug 11, 2026 00:553,90140,779,86231,251,0001,130,0002,117,632stderr
6Aug 11, 2026 00:553,90640,828,13631,192,0001,236,0002,117,632stderr
7Aug 11, 2026 00:553,90840,804,37531,289,0001,151,0002,117,632stderr
8Aug 11, 2026 00:553,91940,929,76531,340,0001,195,0002,117,632stderr
9Aug 11, 2026 00:554,19343,841,81933,656,0001,154,0002,117,632stderr