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 11, 2026 19:24olliecrowolliecrowScore: 6,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:245,79775,822,69244,108,0004,009,0002,310,144
2Feb 11, 2026 19:245,81770,374,07846,267,0002,011,0002,498,560
3Feb 11, 2026 19:245,84080,362,85742,415,0006,059,0002,379,776
4Feb 11, 2026 19:246,31283,012,89447,350,0005,037,0002,265,088
5Feb 11, 2026 19:246,34377,412,41445,691,0006,953,0002,433,024
6Feb 11, 2026 19:246,35885,779,99644,806,0007,965,0002,408,448