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 21, 2026 14:25Victor MerckléVictor MerckléScore: 4,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 14:264,65748,785,51937,578,0001,082,0002,113,536
2May 21, 2026 14:264,65847,237,40437,617,0001,051,0002,113,536
3May 21, 2026 14:264,66749,141,18637,650,0001,090,0002,113,536
4May 21, 2026 14:264,66747,406,73437,732,0001,007,0002,113,536
5May 21, 2026 14:264,67348,930,61337,711,0001,077,0002,113,536
6May 21, 2026 14:264,67349,068,46237,787,0001,001,0002,113,536
7May 21, 2026 14:264,69248,545,83637,919,0001,028,0002,113,536
8May 21, 2026 14:264,69949,684,73737,947,0001,057,0002,113,536
9May 21, 2026 14:264,71248,737,49038,028,0001,088,0002,113,536