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 25, 2026 14:32Victor MerckléVictor MerckléScore: 4,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 14:334,27243,825,91234,372,0001,087,0002,117,632stderr
2Aug 25, 2026 14:334,27943,890,01834,439,0001,084,0002,117,632stderr
3Aug 25, 2026 14:334,28943,972,24834,564,0001,042,0002,117,632stderr
4Aug 25, 2026 14:334,29244,127,06034,530,0001,094,0002,117,632stderr
5Aug 25, 2026 14:334,30844,168,15434,624,0001,134,0002,117,632stderr
6Aug 25, 2026 14:334,31044,152,67234,709,0001,070,0002,117,632stderr
7Aug 25, 2026 14:334,35744,488,48535,145,0001,022,0002,117,632stderr
8Aug 25, 2026 14:334,38945,994,81935,421,0001,014,0002,117,632stderr
9Aug 25, 2026 14:334,70347,434,95438,010,0001,029,0002,117,632stderr