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 20:16boop34boop34Score: 13,502Success
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 20:1613,423121,120,409110,336,0001,075,0002,113,536
2Jul 14, 2026 20:1613,424121,061,527110,376,0001,047,0002,113,536
3Jul 14, 2026 20:1613,462121,728,045110,690,0001,049,0002,113,536
4Jul 14, 2026 20:1613,470121,430,769110,760,0001,047,0002,113,536
5Jul 14, 2026 20:1613,502122,292,933111,016,0001,053,0002,113,536
6Jul 14, 2026 20:1613,584123,061,928111,679,0001,072,0002,113,536
7Jul 14, 2026 20:1613,593123,066,432111,759,0001,064,0002,113,536
8Jul 14, 2026 20:1613,613123,257,009111,892,0001,102,0002,113,536
9Jul 14, 2026 20:1614,084126,969,782115,841,0001,059,0002,113,536