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 listOct 17, 2025 12:24RyogaRyogaScore: 174,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2025 12:24173,8271,471,789,2841,228,946,000213,816,0002,342,912
2Oct 17, 2025 12:24174,2731,471,436,9221,234,545,000211,921,0002,342,912
3Oct 17, 2025 12:24174,3471,466,973,4711,228,220,000218,861,0002,347,008
4Oct 17, 2025 12:24174,5351,474,350,2571,232,843,000215,797,0002,269,184
5Oct 17, 2025 12:24174,8801,480,121,2761,232,729,000218,774,0002,334,720
6Oct 17, 2025 12:24174,8901,475,440,4201,232,649,000218,937,0002,330,624
7Oct 17, 2025 12:24175,2871,475,438,9851,235,050,000219,831,0002,449,408
8Oct 17, 2025 12:24175,4341,477,051,1241,236,237,000219,864,0002,338,816
9Oct 17, 2025 12:24176,7291,491,349,9441,249,022,000217,829,0002,269,184