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 16:00Victor MerckléVictor MerckléScore: 3,785Success
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 16:013,75739,584,12130,114,0001,074,0002,117,632stderr
2Aug 12, 2026 16:013,77239,718,05330,225,0001,085,0002,117,632stderr
3Aug 12, 2026 16:013,77239,730,42130,146,0001,166,0002,117,632stderr
4Aug 12, 2026 16:013,77539,688,35230,255,0001,081,0002,117,632stderr
5Aug 12, 2026 16:013,78539,861,25330,259,0001,161,0002,117,632stderr
6Aug 12, 2026 16:013,78539,851,66730,313,0001,110,0002,117,632stderr
7Aug 12, 2026 16:013,79239,882,26730,393,0001,084,0002,117,632stderr
8Aug 12, 2026 16:013,79339,872,40130,391,0001,091,0002,117,632stderr
9Aug 12, 2026 16:013,80240,002,69430,437,0001,125,0002,117,632stderr