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 21, 2026 13:22Victor MerckléVictor MerckléScore: 4,655Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 13:234,62348,096,46437,306,0001,065,0002,113,536
2May 21, 2026 13:234,62948,026,83837,362,0001,059,0002,113,536
3May 21, 2026 13:234,63848,036,12337,419,0001,077,0002,113,536
4May 21, 2026 13:234,65048,245,77637,569,0001,031,0002,113,536
5May 21, 2026 13:234,65546,591,50837,586,0001,052,0002,113,536
6May 21, 2026 13:234,66747,184,55837,716,0001,028,0002,113,536
7May 21, 2026 13:234,66847,059,68937,683,0001,068,0002,113,536
8May 21, 2026 13:234,67046,901,19437,736,0001,030,0002,113,536
9May 21, 2026 13:234,67049,463,17137,729,0001,037,0002,113,536