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 26, 2026 23:59Victor MerckléVictor MerckléScore: 4,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 23:594,76147,898,98738,267,0001,253,0002,117,632stderr
2Aug 26, 2026 23:594,76447,947,04938,272,0001,272,0002,117,632stderr
3Aug 26, 2026 23:594,78448,094,54838,500,0001,209,0002,117,632stderr
4Aug 26, 2026 23:594,80748,285,83138,688,0001,214,0002,117,632stderr
5Aug 26, 2026 23:594,82548,560,48139,036,0001,014,0002,117,632stderr
6Aug 26, 2026 23:594,88048,900,57139,310,0001,200,0002,117,632stderr
7Aug 26, 2026 23:594,95550,149,02639,945,0001,184,0002,117,632stderr
8Aug 26, 2026 23:594,96250,269,40640,179,0001,012,0002,117,632stderr
9Aug 26, 2026 23:595,10651,387,51141,192,0001,193,0002,117,632stderr