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 11:49Victor MerckléVictor MerckléScore: 3,879Success
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 11:493,82940,867,50130,593,0001,190,0002,117,632stderr
2Aug 12, 2026 11:493,83440,171,98730,682,0001,145,0002,117,632stderr
3Aug 12, 2026 11:493,85640,167,28230,909,0001,096,0002,117,632stderr
4Aug 12, 2026 11:493,86240,504,99830,816,0001,244,0002,117,632stderr
5Aug 12, 2026 11:493,87940,490,93131,087,0001,110,0002,117,632stderr
6Aug 12, 2026 11:493,90741,495,95631,291,0001,144,0002,117,632stderr
7Aug 12, 2026 11:493,94841,084,64131,669,0001,100,0002,117,632stderr
8Aug 12, 2026 11:493,96741,405,07331,860,0001,074,0002,117,632stderr
9Aug 12, 2026 11:494,04741,964,54032,531,0001,060,0002,117,632stderr