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 00:05boop34boop34Error
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 00:050175,085,884164,016,0001,049,0002,113,536expected "53693919560463242 ", got "53693917000463242 "
2Jul 14, 2026 00:0519,854174,497,782163,735,0001,054,0002,113,536
3Jul 14, 2026 00:0519,855174,506,838163,741,0001,056,0002,113,536
4Jul 14, 2026 00:0519,866174,587,822163,844,0001,046,0002,113,536
5Jul 14, 2026 00:0519,872174,571,857163,808,0001,130,0002,113,536
6Jul 14, 2026 00:0519,875175,367,704163,960,0001,006,0002,113,536
7Jul 14, 2026 00:0519,880175,398,824163,939,0001,071,0002,113,536
8Jul 14, 2026 00:0519,883175,259,539163,981,0001,052,0002,113,536
9Jul 14, 2026 00:0520,449179,407,268168,627,0001,104,0002,113,536