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 08:59wnwnScore: 3,351Success
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 09:003,34035,798,67026,692,0001,032,0002,113,536
2Jul 10, 2026 09:003,34335,793,15626,719,0001,031,0002,113,536
3Jul 10, 2026 09:003,34435,598,45426,723,0001,035,0002,113,536
4Jul 10, 2026 09:003,34735,633,63926,780,0001,004,0002,113,536
5Jul 10, 2026 09:003,35135,823,39626,786,0001,029,0002,113,536
6Jul 10, 2026 09:003,39636,306,56027,184,0001,011,0002,113,536
7Jul 10, 2026 09:003,50236,954,72328,032,0001,038,0002,113,536
8Jul 10, 2026 09:003,51337,766,58628,160,0001,006,0002,113,536
9Jul 10, 2026 09:003,51637,783,12028,177,0001,008,0002,113,536