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:22Victor MerckléVictor MerckléScore: 7,213Success
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:237,15668,358,07958,275,0001,122,0002,117,632stderr
2Aug 25, 2026 14:237,16567,854,33558,389,0001,082,0002,117,632stderr
3Aug 25, 2026 14:237,19068,055,65858,572,0001,106,0002,117,632stderr
4Aug 25, 2026 14:237,20768,214,32258,742,0001,081,0002,117,632stderr
5Aug 25, 2026 14:237,21368,263,23958,722,0001,150,0002,117,632stderr
6Aug 25, 2026 14:237,21868,300,96158,804,0001,113,0002,117,632stderr
7Aug 25, 2026 14:237,23768,462,35058,997,0001,073,0002,117,632stderr
8Aug 25, 2026 14:237,28568,895,11559,407,0001,064,0002,117,632stderr
9Aug 25, 2026 14:237,41271,039,49560,444,0001,083,0002,117,632stderr