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 25, 2026 19:13Maya RebholzMaya RebholzScore: 6,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 19:136,04960,304,68845,011,0005,199,0002,117,632
2May 25, 2026 19:136,14661,795,70345,382,0005,637,0002,117,632
3May 25, 2026 19:136,18063,530,65646,100,0005,196,0002,117,632
4May 25, 2026 19:136,18665,551,42845,780,0005,566,0002,117,632
5May 25, 2026 19:136,25663,767,68846,435,0005,497,0002,113,536
6May 25, 2026 19:136,29065,032,95846,511,0005,701,0002,113,536
7May 25, 2026 19:136,34062,094,71147,399,0005,223,0002,117,632
8May 25, 2026 19:136,35362,112,17047,536,0005,195,0002,113,536
9May 25, 2026 19:136,48365,074,86948,213,0005,603,0002,113,536