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 30, 2026 17:26boop34boop34Score: 21,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 17:2721,339187,019,439175,932,0001,185,0002,113,536
2Jul 30, 2026 17:2721,341187,699,388176,026,0001,108,0002,113,536
3Jul 30, 2026 17:2721,346187,039,602176,069,0001,104,0002,113,536
4Jul 30, 2026 17:2721,346187,056,738176,068,0001,106,0002,113,536
5Jul 30, 2026 17:2721,346187,016,927176,076,0001,099,0002,113,536
6Jul 30, 2026 17:2721,353187,077,042176,056,0001,176,0002,113,536
7Jul 30, 2026 17:2721,354187,069,948176,074,0001,172,0002,113,536
8Jul 30, 2026 17:2721,362187,281,546176,291,0001,021,0002,113,536
9Jul 30, 2026 17:2721,368187,319,614176,346,0001,015,0002,113,536