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 17, 2026 18:54wnwnScore: 7,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 18:546,70782,658,11952,628,0003,036,0002,506,752
2Feb 17, 2026 18:546,76884,539,39853,165,0003,009,0002,478,080
3Feb 17, 2026 18:546,84783,257,66152,841,0003,988,0002,273,280
4Feb 17, 2026 18:547,74684,744,15061,277,0003,013,0002,441,216
5Feb 17, 2026 18:547,78196,831,97662,565,0002,018,0002,428,928
6Feb 17, 2026 18:547,81391,957,83861,853,0002,992,0002,412,544