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 15:48boop34boop34Score: 19,867Success
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 15:4919,853174,540,359163,725,0001,060,0002,113,536
2Jul 14, 2026 15:4919,860175,201,408163,788,0001,055,0002,113,536
3Jul 14, 2026 15:4919,864174,597,803163,805,0001,071,0002,113,536
4Jul 14, 2026 15:4919,865175,246,350163,800,0001,086,0002,113,536
5Jul 14, 2026 15:4919,867175,723,791163,815,0001,086,0002,113,536
6Jul 14, 2026 15:4919,872174,776,798163,822,0001,119,0002,113,536
7Jul 14, 2026 15:4919,872175,214,007163,856,0001,082,0002,113,536
8Jul 14, 2026 15:4919,886175,138,279163,982,0001,073,0002,113,536
9Jul 14, 2026 15:4920,390179,817,383168,183,0001,062,0002,113,536