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 31, 2026 19:01George SeabridgeGeorge SeabridgeScore: 8,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 19:018,88083,703,54772,701,0001,010,0002,113,536
2Jul 31, 2026 19:018,92784,058,40973,020,0001,076,0002,113,536
3Jul 31, 2026 19:018,92784,051,18573,002,0001,095,0002,113,536
4Jul 31, 2026 19:018,93684,215,82473,082,0001,091,0002,113,536
5Jul 31, 2026 19:018,94284,306,83173,127,0001,097,0002,113,536
6Jul 31, 2026 19:018,94784,312,73073,176,0001,090,0002,113,536
7Jul 31, 2026 19:018,97984,493,17573,381,0001,149,0002,113,536
8Jul 31, 2026 19:019,02684,975,21973,851,0001,072,0002,113,536
9Jul 31, 2026 19:019,02984,912,46373,852,0001,089,0002,113,536