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 23:22olliecrowolliecrowScore: 6,344Success
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 23:225,79572,509,74044,088,0004,008,0002,514,944
2Feb 11, 2026 18:125,81478,675,57044,237,0004,021,0002,363,392
3Feb 11, 2026 18:125,83176,515,27643,458,0004,938,0002,424,832
4Feb 11, 2026 18:125,84073,891,68944,432,0004,039,0002,408,448
5Feb 2, 2026 23:225,88580,662,14941,870,0006,978,0002,461,696
6Feb 2, 2026 23:225,90978,213,15240,038,0009,008,0002,277,376
7Feb 2, 2026 23:226,34484,644,10348,679,0003,973,0002,367,488
8Feb 11, 2026 18:126,34582,523,55246,700,0005,961,0002,498,560
9Feb 2, 2026 23:226,35884,915,00344,807,0007,965,0002,404,352
10Feb 11, 2026 18:126,36681,458,59347,855,0004,984,0002,498,560
11Feb 2, 2026 23:226,40184,671,41946,113,0007,017,0002,342,912
12Feb 11, 2026 18:126,46382,131,32046,690,0006,953,0002,326,528