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 listSep 1, 2026 07:09Victor MerckléVictor MerckléScore: 4,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 07:094,72448,093,84038,107,0001,109,0002,117,632stderr
2Sep 1, 2026 07:094,72647,363,94638,117,0001,112,0002,117,632stderr
3Sep 1, 2026 07:094,73148,333,73338,143,0001,130,0002,117,632stderr
4Sep 1, 2026 07:094,73248,385,20638,182,0001,099,0002,117,632stderr
5Sep 1, 2026 07:094,73647,698,24138,212,0001,105,0002,117,632stderr
6Sep 1, 2026 07:094,73647,642,82838,227,0001,088,0002,117,632stderr
7Sep 1, 2026 07:094,73848,335,39638,222,0001,108,0002,117,632stderr
8Sep 1, 2026 07:094,78148,094,56838,659,0001,030,0002,117,632stderr
9Sep 1, 2026 07:094,80048,211,71438,749,0001,091,0002,117,632stderr