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 4, 2026 10:12limanjun99limanjun99Score: 4,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 10:124,65454,732,07036,366,0002,266,0002,498,560
2May 4, 2026 10:124,67156,490,46436,518,0002,256,0002,506,752
3May 4, 2026 10:124,67754,326,06035,564,0003,256,0002,502,656
4May 4, 2026 10:124,69356,740,81335,646,0003,313,0002,502,656
5May 4, 2026 10:124,71054,370,22335,595,0003,504,0002,502,656
6May 4, 2026 10:124,71257,896,81135,953,0003,159,0002,498,560
7May 4, 2026 10:124,75356,360,42636,266,0003,190,0002,494,464
8May 4, 2026 10:124,83656,674,22636,916,0003,227,0002,502,656
9May 4, 2026 10:124,84856,447,52037,121,0003,121,0002,510,848