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, 2025 20:40Safronov AlekseiSafronov AlekseiScore: 50,173Success
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, 2025 20:4050,131443,935,574414,091,0002,000,0002,260,992
2Jul 15, 2025 20:4050,165441,455,293414,365,0002,001,0002,277,376
3Jul 15, 2025 20:4050,171444,104,602413,417,0003,003,0002,277,376
4Jul 15, 2025 20:4050,171449,069,262414,419,0002,002,0002,519,040
5Jul 15, 2025 20:4050,173443,289,058414,433,0002,002,0002,273,280
6Jul 15, 2025 20:4050,175442,146,453413,450,0003,003,0002,277,376
7Jul 15, 2025 20:4050,180455,776,774414,492,0002,002,0002,269,184
8Jul 15, 2025 20:4050,192444,548,783414,593,0001,998,0002,277,376
9Jul 15, 2025 20:4050,218439,472,810412,815,0003,998,0002,277,376