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 listJun 25, 2026 20:02Victor MerckléVictor MerckléScore: 4,205Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 20:034,17342,110,97433,534,0001,109,0002,117,632stderr
2Jun 25, 2026 20:034,17442,122,17733,573,0001,075,0002,117,632stderr
3Jun 25, 2026 20:034,18042,238,95833,580,0001,118,0002,117,632stderr
4Jun 25, 2026 20:034,20542,424,89633,875,0001,028,0002,117,632stderr
5Jun 25, 2026 20:034,20542,484,07833,876,0001,029,0002,117,632stderr
6Jun 25, 2026 20:034,21142,454,09433,840,0001,118,0002,117,632stderr
7Jun 25, 2026 20:034,22944,008,51633,993,0001,108,0002,117,632stderr
8Jun 25, 2026 20:034,37643,906,27535,208,0001,117,0002,117,632stderr
9Jun 25, 2026 20:034,43544,392,95135,791,0001,023,0002,117,632stderr