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 20, 2026 10:27M-RochatM-RochatScore: 6,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:286,81867,738,49854,546,0002,051,0002,113,536
2May 20, 2026 10:286,83066,127,17154,548,0002,148,0002,113,536
3May 20, 2026 10:286,85166,507,88554,711,0002,154,0002,113,536
4May 20, 2026 10:286,85167,081,77254,660,0002,208,0002,113,536
5May 20, 2026 10:286,85466,906,26254,742,0002,150,0002,113,536
6May 20, 2026 10:286,85767,939,14654,759,0002,156,0002,113,536
7May 20, 2026 10:286,86566,504,71254,809,0002,177,0002,113,536
8May 20, 2026 10:286,87366,807,52354,842,0002,205,0002,113,536
9May 20, 2026 10:286,87967,948,83854,920,0002,181,0002,113,536