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 16, 2026 16:41boop34boop34Score: 9,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 16:428,99484,298,23873,629,0001,026,0002,113,536
2Jul 16, 2026 16:429,00384,286,65473,723,0001,008,0002,113,536
3Jul 16, 2026 16:429,01384,496,56973,804,0001,012,0002,113,536
4Jul 16, 2026 16:429,02484,523,61973,898,0001,009,0002,113,536
5Jul 16, 2026 16:429,04184,608,79474,036,0001,005,0002,113,536
6Jul 16, 2026 16:429,04784,661,57774,080,0001,012,0002,113,536
7Jul 16, 2026 16:429,08785,025,26574,353,0001,072,0002,113,536
8Jul 16, 2026 16:429,17985,752,54375,177,0001,011,0002,113,536
9Jul 16, 2026 16:429,46288,078,76377,528,0001,007,0002,113,536