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 15, 2026 16:26boop34boop34Score: 9,043Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 16:279,01284,467,39173,606,0001,195,0002,113,536
2Jul 15, 2026 16:279,02784,500,00773,790,0001,137,0002,113,536
3Jul 15, 2026 16:279,03784,642,33173,737,0001,272,0002,113,536
4Jul 15, 2026 16:279,03984,674,83473,823,0001,205,0002,113,536
5Jul 15, 2026 16:279,04384,662,25673,936,0001,127,0002,113,536
6Jul 15, 2026 16:279,18685,946,48175,126,0001,118,0002,113,536
7Jul 15, 2026 16:279,23486,205,61875,547,0001,098,0002,113,536
8Jul 15, 2026 16:279,24686,333,38075,559,0001,187,0002,113,536
9Jul 15, 2026 16:279,25186,405,18475,688,0001,097,0002,113,536