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 1, 2026 13:45George SeabridgeGeorge SeabridgeScore: 8,161Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 13:456,84866,798,04155,762,0001,084,0002,113,536
2Aug 1, 2026 13:458,12877,465,12166,375,0001,092,0002,113,536
3Aug 1, 2026 13:458,14177,497,34166,466,0001,111,0002,113,536
4Aug 1, 2026 13:458,14977,693,21766,544,0001,100,0002,113,536
5Aug 1, 2026 13:458,16177,780,98866,645,0001,093,0002,113,536
6Aug 1, 2026 13:458,16677,844,78566,560,0001,221,0002,113,536
7Aug 1, 2026 13:458,16677,689,99066,694,0001,084,0002,113,536
8Aug 1, 2026 13:458,17377,873,76066,746,0001,096,0002,113,536
9Aug 1, 2026 13:458,23378,375,81467,325,0001,017,0002,113,536