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 12, 2026 15:00Victor MerckléVictor MerckléScore: 3,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 15:013,74339,498,30129,936,0001,133,0002,117,632stderr
2Aug 12, 2026 15:013,75539,608,75130,058,0001,110,0002,117,632stderr
3Aug 12, 2026 15:013,76039,638,74430,090,0001,123,0002,117,632stderr
4Aug 12, 2026 15:013,76439,629,25630,139,0001,106,0002,117,632stderr
5Aug 12, 2026 15:013,76839,795,66630,099,0001,180,0002,117,632stderr
6Aug 12, 2026 15:013,78039,827,40830,332,0001,048,0002,117,632stderr
7Aug 12, 2026 15:013,79039,882,31630,362,0001,096,0002,117,632stderr
8Aug 12, 2026 15:013,80039,967,20330,469,0001,078,0002,117,632stderr
9Aug 12, 2026 15:013,81040,059,54130,498,0001,127,0002,117,632stderr