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 21:58Victor MerckléVictor MerckléScore: 10,311Success
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 21:5910,21093,793,58183,602,0001,149,0002,117,632stderr
2Aug 26, 2026 21:5910,24893,519,95883,911,0001,154,0002,117,632stderr
3Aug 26, 2026 21:5910,27194,828,61984,165,0001,087,0002,117,632stderr
4Aug 26, 2026 21:5910,29993,876,24084,345,0001,140,0002,117,632stderr
5Aug 26, 2026 21:5910,31193,946,75784,506,0001,079,0002,117,632stderr
6Aug 26, 2026 21:5910,33494,117,43884,629,0001,151,0002,117,632stderr
7Aug 26, 2026 21:5910,39394,657,37385,195,0001,072,0002,117,632stderr
8Aug 26, 2026 21:5910,44995,067,44885,649,0001,085,0002,117,632stderr
9Aug 26, 2026 21:5910,49695,460,81586,025,0001,100,0002,117,632stderr