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 08:03Dominique GarmierDominique GarmierScore: 9,898Success
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 08:049,764100,817,79178,041,0003,001,0002,428,928
2Apr 24, 2026 08:049,797105,274,59180,307,0001,016,0002,433,024
3Apr 24, 2026 08:049,80694,311,70379,383,0002,009,0002,449,408
4Apr 24, 2026 08:049,825108,568,77979,535,0002,013,0002,441,216
5Apr 24, 2026 08:049,89897,839,44979,150,0003,005,0002,441,216
6Apr 24, 2026 08:049,930101,429,98380,412,0002,010,0002,445,312
7Apr 24, 2026 08:049,93197,883,50280,420,0002,010,0002,441,216
8Apr 24, 2026 08:049,93998,440,92580,486,0002,012,0002,441,216
9Apr 24, 2026 08:049,947105,209,37180,555,0002,013,0002,437,120