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 11, 2026 11:47Victor MerckléVictor MerckléScore: 10,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 11:4710,65597,671,04687,193,0001,250,0002,113,536
2May 11, 2026 11:4710,659100,787,15787,216,0001,258,0002,113,536
3May 11, 2026 11:4710,67499,065,99987,333,0001,269,0002,113,536
4May 11, 2026 11:4710,67598,069,55987,598,0001,009,0002,113,536
5May 11, 2026 11:4710,67797,942,22187,611,0001,010,0002,113,536
6May 11, 2026 11:4710,67899,640,21787,621,0001,010,0002,113,536
7May 11, 2026 11:4710,67999,274,94287,362,0001,274,0002,113,536
8May 11, 2026 11:4710,68198,471,76187,645,0001,012,0002,113,536
9May 11, 2026 11:4710,68197,839,18787,648,0001,011,0002,113,536