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 22, 2026 10:12Omkar SinghOmkar SinghScore: 381,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 10:15377,8743,146,274,1933,071,307,00065,050,0002,113,536
2Jun 22, 2026 10:15378,1453,148,047,8193,074,391,00064,213,0002,113,536
3Jun 22, 2026 10:15378,4103,150,138,5983,074,734,00066,073,0002,113,536
4Jun 22, 2026 10:15379,8893,162,400,2793,087,040,00066,046,0002,113,536
5Jun 22, 2026 10:15381,1403,172,770,0143,097,413,00066,053,0002,113,536
6Jun 22, 2026 10:15382,0693,180,501,2763,104,124,00067,049,0002,113,536
7Jun 22, 2026 10:15382,6223,185,134,2873,110,712,00065,054,0002,113,536
8Jun 22, 2026 10:15383,5453,192,901,4983,117,383,00066,042,0002,113,536
9Jun 22, 2026 10:15384,9173,204,565,2683,129,584,00065,235,0002,113,536