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 listJun 30, 2026 19:12KnyukuaKnyukuaScore: 763,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 19:13763,3776,345,747,1216,271,987,00064,048,0002,113,536
2Jun 30, 2026 19:13763,4206,346,462,7876,271,153,00065,238,0002,113,536
3Jun 30, 2026 19:13763,4876,347,034,4216,271,907,00065,043,0002,113,536
4Jun 30, 2026 19:13763,4896,347,022,7166,271,846,00065,120,0002,113,536
5Jun 30, 2026 19:13763,5206,347,103,6516,271,066,00066,152,0002,113,536
6Jun 30, 2026 19:13763,6086,347,872,7816,272,915,00065,039,0002,113,536
7Jun 30, 2026 19:13763,6936,349,134,5826,271,606,00067,048,0002,113,536
8Jun 30, 2026 19:13764,1516,352,436,4686,277,414,00065,042,0002,113,536
9Jun 30, 2026 19:13766,5966,373,025,1766,296,650,00066,104,0002,113,536