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 listAug 27, 2026 17:23Victor MerckléVictor MerckléScore: 5,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 17:245,72055,844,91346,454,0001,029,0002,113,536
2Aug 27, 2026 17:245,72255,848,73746,472,0001,027,0002,113,536
3Aug 27, 2026 17:245,76256,301,77946,781,0001,048,0002,113,536
4Aug 27, 2026 17:245,76456,262,02346,748,0001,097,0002,113,536
5Aug 27, 2026 17:245,79056,553,56047,028,0001,033,0002,113,536
6Aug 27, 2026 17:245,79656,617,59247,084,0001,030,0002,113,536
7Aug 27, 2026 17:245,80957,328,38047,161,0001,060,0002,113,536
8Aug 27, 2026 17:245,82556,771,16747,314,0001,039,0002,113,536
9Aug 27, 2026 17:245,83157,442,42747,328,0001,072,0002,113,536