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 13, 2026 11:34Victor MerckléVictor MerckléScore: 7,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 11:347,91372,985,04765,684,00002,113,536
2May 13, 2026 11:347,92175,781,22564,735,0001,010,0002,113,536
3May 13, 2026 11:347,92273,879,27965,758,00002,113,536
4May 13, 2026 11:347,92375,850,66964,746,0001,016,0002,113,536
5May 13, 2026 11:347,92573,012,00864,759,0001,025,0002,113,536
6May 13, 2026 11:347,92574,865,81064,756,0001,024,0002,113,536
7May 13, 2026 11:347,92975,051,69264,765,0001,048,0002,113,536
8May 13, 2026 11:347,92974,991,55664,773,0001,045,0002,113,536
9May 13, 2026 11:348,03573,957,21965,651,0001,045,0002,113,536