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 listJun 30, 2026 11:27Adam FolwarcznyAdam FolwarcznyScore: 9,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 11:279,80290,666,91980,360,0001,002,0002,113,536
2Jun 30, 2026 11:279,80290,662,73380,316,0001,041,0002,113,536
3Jun 30, 2026 11:279,80490,720,58580,337,0001,041,0002,113,536
4Jun 30, 2026 11:279,81592,009,96180,303,0001,168,0002,113,536
5Jun 30, 2026 11:279,81990,851,62880,328,0001,177,0002,113,536
6Jun 30, 2026 11:279,83490,901,22880,475,0001,155,0002,113,536
7Jun 30, 2026 11:279,84491,078,29380,538,0001,172,0002,113,536
8Jun 30, 2026 11:279,89891,372,13481,106,0001,055,0002,113,536
9Jun 30, 2026 11:279,90491,460,30781,050,0001,160,0002,113,536