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:49Maya RebholzMaya RebholzScore: 6,830Success
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:506,75967,053,36250,880,0005,226,0002,117,632
2May 25, 2026 19:506,77067,636,11250,903,0005,295,0002,113,536
3May 25, 2026 19:506,79667,920,44750,917,0005,495,0002,117,632
4May 25, 2026 19:506,81766,576,50051,119,0005,470,0002,113,536
5May 25, 2026 19:506,83068,802,77051,002,0005,694,0002,113,536
6May 25, 2026 19:506,83166,880,32151,175,0005,524,0002,117,632
7May 25, 2026 19:506,85568,472,11351,456,0005,441,0002,117,632
8May 25, 2026 19:506,86269,581,68451,475,0005,487,0002,117,632
9May 25, 2026 19:506,93068,716,66251,779,0005,748,0002,117,632