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 14, 2026 21:11boop34boop34Score: 13,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 21:1213,389120,769,949110,104,0001,025,0002,113,536
2Jul 14, 2026 21:1213,444121,280,094110,534,0001,058,0002,113,536
3Jul 14, 2026 21:1213,493121,954,596110,913,0001,080,0002,113,536
4Jul 14, 2026 21:1213,543123,387,180111,338,0001,076,0002,113,536
5Jul 14, 2026 21:1213,548122,775,012111,393,0001,059,0002,113,536
6Jul 14, 2026 21:1213,550122,731,051111,388,0001,077,0002,113,536
7Jul 14, 2026 21:1213,570122,477,246111,593,0001,046,0002,113,536
8Jul 14, 2026 21:1213,571122,868,393111,569,0001,071,0002,113,536
9Jul 14, 2026 21:1214,050126,846,031115,552,0001,070,0002,113,536