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 listAug 27, 2026 10:03Victor MerckléVictor MerckléScore: 3,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 10:033,71939,999,67729,715,0001,158,0002,113,536
2Aug 27, 2026 10:033,73439,963,33829,840,0001,156,0002,113,536
3Aug 27, 2026 10:033,75139,471,34930,045,0001,092,0002,113,536
4Aug 27, 2026 10:033,75139,543,22530,052,0001,086,0002,113,536
5Aug 27, 2026 10:033,75839,591,74830,092,0001,102,0002,113,536
6Aug 27, 2026 10:033,76539,613,95230,124,0001,132,0002,113,536
7Aug 27, 2026 10:033,95041,905,20831,591,0001,202,0002,113,536
8Aug 27, 2026 10:033,95241,861,06831,711,0001,093,0002,113,536
9Aug 27, 2026 10:033,95941,282,66531,785,0001,075,0002,113,536