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:10Victor MerckléVictor MerckléScore: 3,847Success
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:113,79539,872,40930,358,0001,146,0002,117,632stderr
2Aug 12, 2026 16:113,81340,065,41730,585,0001,063,0002,117,632stderr
3Aug 12, 2026 16:113,83140,262,12930,677,0001,123,0002,117,632stderr
4Aug 12, 2026 16:113,84240,320,78630,820,0001,069,0002,117,632stderr
5Aug 12, 2026 16:113,84740,317,54530,862,0001,070,0002,117,632stderr
6Aug 12, 2026 16:113,85040,338,73930,860,0001,099,0002,117,632stderr
7Aug 12, 2026 16:113,86240,474,13330,979,0001,079,0002,117,632stderr
8Aug 12, 2026 16:113,89540,792,26631,241,0001,095,0002,117,632stderr
9Aug 12, 2026 16:113,90640,872,20531,332,0001,090,0002,117,632stderr