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 listJul 22, 2026 19:26Kevin HeaveyKevin HeaveyScore: 3,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 19:273,67340,152,72929,334,0001,160,0002,113,536
2Jul 22, 2026 19:273,67940,290,66429,377,0001,159,0002,113,536
3Jul 22, 2026 19:273,72940,696,57829,717,0001,237,0002,113,536
4Jul 22, 2026 19:273,78141,063,51530,153,0001,236,0002,113,536
5Jul 22, 2026 19:273,79141,199,60830,254,0001,216,0002,113,536
6Jul 22, 2026 19:273,79341,217,58730,304,0001,185,0002,113,536
7Jul 22, 2026 19:273,79741,277,06830,483,0001,038,0002,113,536
8Jul 22, 2026 19:273,81341,291,62330,442,0001,210,0002,113,536
9Jul 22, 2026 19:273,82742,038,81930,545,0001,227,0002,113,536