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 listFeb 2, 2026 03:09Josu San MartinJosu San MartinScore: 5,701Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 03:095,46674,012,10244,357,0001,008,0002,367,488
2Feb 2, 2026 03:095,52867,187,76844,883,000997,0002,375,680
3Feb 2, 2026 03:095,60870,124,51445,537,0001,011,0002,359,296
4Feb 2, 2026 03:095,61773,672,28146,625,00002,277,376
5Feb 2, 2026 03:095,64175,147,36343,831,0002,988,0002,355,200
6Feb 2, 2026 03:095,66076,646,32245,981,000999,0002,502,656
7Feb 2, 2026 03:095,70170,590,14845,304,0002,013,0002,269,184
8Feb 2, 2026 03:095,79974,630,41947,127,0001,002,0002,494,464
9Feb 2, 2026 03:095,83369,958,94948,410,00002,498,560
10Feb 2, 2026 03:095,90377,340,64947,992,000999,0002,367,488
11Feb 2, 2026 03:095,90475,578,37748,004,0001,000,0002,281,472
12Feb 2, 2026 03:095,92672,529,67746,176,0003,011,0002,506,752