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 00:36Victor MerckléVictor MerckléScore: 3,830Success
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 00:373,78639,853,29530,235,0001,191,0002,117,632stderr
2Aug 25, 2026 00:373,79939,918,33430,321,0001,215,0002,117,632stderr
3Aug 25, 2026 00:373,80640,631,92430,350,0001,248,0002,117,632stderr
4Aug 25, 2026 00:373,81740,717,43130,431,0001,252,0002,117,632stderr
5Aug 25, 2026 00:373,83040,173,98330,558,0001,236,0002,117,632stderr
6Aug 25, 2026 00:373,83140,152,43330,575,0001,227,0002,117,632stderr
7Aug 25, 2026 00:373,83940,923,24830,848,0001,020,0002,117,632stderr
8Aug 25, 2026 00:373,84940,335,19830,796,0001,158,0002,117,632stderr
9Aug 25, 2026 00:373,92540,946,22531,315,0001,270,0002,117,632stderr