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 13:48Victor MerckléVictor MerckléScore: 80,207Success
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 13:4979,563668,848,149655,039,0005,336,0002,117,632stderr
2Aug 12, 2026 13:4979,600669,173,843655,216,0005,467,0002,117,632stderr
3Aug 12, 2026 13:4980,021672,715,175658,515,0005,661,0002,117,632stderr
4Aug 12, 2026 13:4980,187674,141,876660,158,0005,400,0002,117,632stderr
5Aug 12, 2026 13:4980,207674,131,790660,334,0005,387,0002,117,632stderr
6Aug 12, 2026 13:4980,395675,716,572661,811,0005,470,0002,117,632stderr
7Aug 12, 2026 13:4980,414675,902,170662,079,0005,363,0002,117,632stderr
8Aug 12, 2026 13:4980,518676,939,707662,688,0005,612,0002,117,632stderr
9Aug 12, 2026 13:4980,907680,148,333665,563,0005,970,0002,117,632stderr