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 3, 2026 20:12Josu San MartinJosu San MartinScore: 13,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 20:1213,760123,537,984107,551,0006,659,0002,117,632
2Jul 3, 2026 20:1213,788123,799,876107,688,0006,757,0002,121,728
3Jul 3, 2026 20:1213,817124,153,836108,095,0006,590,0002,117,632
4Jul 3, 2026 20:1213,840124,260,581108,289,0006,584,0002,117,632
5Jul 3, 2026 20:1213,843124,292,008108,261,0006,644,0002,117,632
6Jul 3, 2026 20:1213,881124,580,843108,446,0006,774,0002,117,632
7Jul 3, 2026 20:1213,889124,677,808108,551,0006,729,0002,117,632
8Jul 3, 2026 20:1213,963126,451,969109,240,0006,656,0002,117,632
9Jul 3, 2026 20:1213,973125,365,202109,227,0006,756,0002,117,632