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 20, 2026 20:33PaulPaulScore: 127,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 20:35127,7141,072,373,250998,479,00061,554,0002,138,112
2Jul 20, 2026 20:35127,8131,071,860,973999,578,00061,277,0002,138,112
3Jul 20, 2026 20:35127,8431,073,198,611999,882,00061,219,0002,138,112
4Jul 20, 2026 20:35127,9591,072,714,4311,000,490,00061,573,0002,138,112
5Jul 20, 2026 20:35127,9661,072,577,8081,000,119,00062,002,0002,138,112
6Jul 20, 2026 20:35128,0191,073,666,8731,000,598,00061,962,0002,138,112
7Jul 20, 2026 20:35128,0311,074,688,2281,000,230,00062,430,0002,142,208
8Jul 20, 2026 20:35128,0541,074,152,0371,000,494,00062,360,0002,138,112
9Jul 20, 2026 20:35128,0621,073,658,7351,000,442,00062,478,0002,138,112