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 10, 2026 12:33boop34boop34Score: 67,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 12:3367,273568,165,209556,363,0002,007,0002,113,536
2Jul 10, 2026 12:3367,302568,322,191556,578,0002,029,0002,113,536
3Jul 10, 2026 12:3367,311568,567,527556,576,0002,109,0002,113,536
4Jul 10, 2026 12:3367,324569,068,056556,735,0002,055,0002,113,536
5Jul 10, 2026 12:3367,327569,027,935556,781,0002,035,0002,113,536
6Jul 10, 2026 12:3367,372569,656,834557,058,0002,133,0002,113,536
7Jul 10, 2026 12:3367,376569,045,578557,208,0002,020,0002,113,536
8Jul 10, 2026 12:3367,388569,128,407558,317,0001,005,0002,113,536
9Jul 10, 2026 12:3367,412569,519,895557,517,0002,008,0002,113,536