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 29, 2026 13:21Saif Al-HarthiSaif Al-HarthiScore: 19,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 13:2119,305169,487,848159,230,0001,004,0002,113,536
2Jun 29, 2026 13:2119,337169,922,180159,499,0001,004,0002,113,536
3Jun 29, 2026 13:2119,341169,832,791159,529,0001,006,0002,113,536
4Jun 29, 2026 13:2119,348169,873,547159,587,0001,005,0002,113,536
5Jun 29, 2026 13:2119,351170,000,126159,614,0001,004,0002,113,536
6Jun 29, 2026 13:2119,352169,917,444159,618,0001,006,0002,113,536
7Jun 29, 2026 13:2119,353169,947,973159,633,0001,005,0002,113,536
8Jun 29, 2026 13:2119,370171,240,146159,770,0001,007,0002,113,536
9Jun 29, 2026 13:2119,481171,063,029160,691,0001,004,0002,113,536