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 19, 2026 16:19Milo PresedoMilo PresedoScore: 8,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 16:207,99376,806,67865,160,0001,189,0002,113,536
2May 19, 2026 16:207,99374,353,73865,117,0001,228,0002,113,536
3May 19, 2026 16:207,99874,287,75665,173,0001,218,0002,113,536
4May 19, 2026 16:207,99876,369,95865,168,0001,222,0002,113,536
5May 19, 2026 16:208,00578,563,80265,234,0001,211,0002,113,536
6May 19, 2026 16:208,00874,862,87865,258,0001,210,0002,113,536
7May 19, 2026 16:208,01574,585,91165,300,0001,227,0002,113,536
8May 19, 2026 16:208,03676,570,60665,494,0001,208,0002,113,536
9May 19, 2026 16:208,73382,656,83271,267,0001,220,0002,113,536