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 23, 2026 17:06Victor MerckléVictor MerckléScore: 3,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:083,75740,364,66030,011,0001,180,0002,117,632stderr
2Aug 23, 2026 17:083,75939,592,74830,113,0001,091,0002,117,632stderr
3Aug 23, 2026 17:083,78639,834,16130,307,0001,119,0002,117,632stderr
4Aug 23, 2026 17:083,94341,239,65931,619,0001,113,0002,117,632stderr
5Aug 23, 2026 17:083,95141,776,52931,711,0001,083,0002,117,632stderr
6Aug 23, 2026 17:084,02343,014,73232,288,0001,105,0002,117,632stderr
7Aug 23, 2026 17:084,03842,395,24532,403,0001,114,0002,117,632stderr
8Aug 23, 2026 17:084,04642,014,80032,460,0001,127,0002,117,632stderr
9Aug 23, 2026 17:084,05242,032,16032,590,0001,048,0002,117,632stderr