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 listMay 24, 2026 15:54Victor MerckléVictor MerckléScore: 9,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 15:559,88591,508,06280,982,0001,066,0002,113,536
2May 24, 2026 15:559,89289,994,19581,006,0001,101,0002,113,536
3May 24, 2026 15:559,89489,948,76181,063,0001,060,0002,113,536
4May 24, 2026 15:559,91690,123,54481,279,0001,028,0002,113,536
5May 24, 2026 15:559,92591,421,01381,346,0001,033,0002,113,536
6May 24, 2026 15:559,92791,215,73781,358,0001,038,0002,113,536
7May 24, 2026 15:559,92992,443,03881,385,0001,028,0002,113,536
8May 24, 2026 15:559,93393,256,87481,424,0001,023,0002,113,536
9May 24, 2026 15:5510,11092,019,05582,781,0001,140,0002,113,536