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 24, 2026 15:09Victor MerckléVictor MerckléScore: 8,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 15:108,89081,603,77772,726,0001,065,0002,113,536
2May 24, 2026 15:108,89583,646,96172,769,0001,060,0002,113,536
3May 24, 2026 15:108,89881,585,51372,795,0001,065,0002,113,536
4May 24, 2026 15:108,90083,389,66572,823,0001,052,0002,113,536
5May 24, 2026 15:108,90683,879,49872,859,0001,069,0002,113,536
6May 24, 2026 15:108,90783,437,38972,865,0001,069,0002,113,536
7May 24, 2026 15:108,92683,219,43373,064,0001,027,0002,113,536
8May 24, 2026 15:108,93781,944,96473,149,0001,036,0002,113,536
9May 24, 2026 15:109,20084,178,96975,333,0001,033,0002,113,536