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 16:51Victor MerckléVictor MerckléScore: 4,644Success
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 16:554,60452,362,97637,157,0001,064,0002,113,536
2May 21, 2026 16:554,61446,156,57937,247,0001,054,0002,113,536
3May 21, 2026 16:554,62646,285,49037,388,0001,009,0002,113,536
4May 21, 2026 16:554,62746,268,89737,400,0001,006,0002,113,536
5May 21, 2026 16:554,64446,419,03037,549,0001,001,0002,113,536
6May 21, 2026 16:554,65046,853,24937,599,0001,002,0002,113,536
7May 21, 2026 16:554,69546,836,26737,817,0001,152,0002,113,536
8May 21, 2026 16:554,70147,308,46737,957,0001,063,0002,113,536
9May 21, 2026 16:554,85048,046,93939,222,0001,033,0002,113,536