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 listApr 24, 2026 07:58Dominique GarmierDominique GarmierScore: 129,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 07:59126,3841,070,186,0341,046,991,0001,999,0002,437,120
2Apr 24, 2026 07:59126,5211,072,943,7701,048,130,0002,000,0002,437,120
3Apr 24, 2026 07:59126,9251,069,261,8051,050,485,0002,998,0002,322,432
4Apr 24, 2026 07:59129,4401,093,708,0631,071,358,0002,998,0002,441,216
5Apr 24, 2026 07:59129,5461,090,334,8131,072,236,0002,997,0002,445,312
6Apr 24, 2026 07:59129,5501,093,366,4561,072,270,0002,997,0002,433,024
7Apr 24, 2026 07:59129,5541,093,668,1231,072,306,0002,998,0002,322,432
8Apr 24, 2026 07:59129,6211,098,557,5911,074,856,000999,0002,445,312
9Apr 24, 2026 07:59129,6911,091,020,3081,073,443,0002,998,0002,441,216