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 listMay 20, 2026 06:39M-RochatM-RochatScore: 11,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:4011,926109,164,23596,754,0002,238,0002,113,536
2May 20, 2026 06:4011,965109,840,95997,018,0002,293,0002,113,536
3May 20, 2026 06:4011,966111,653,43497,078,0002,246,0002,113,536
4May 20, 2026 06:4011,970109,233,55597,093,0002,265,0002,113,536
5May 20, 2026 06:4011,975111,925,33597,135,0002,258,0002,113,536
6May 20, 2026 06:4011,983110,094,10397,195,0002,270,0002,113,536
7May 20, 2026 06:4011,992109,268,73997,264,0002,277,0002,113,536
8May 20, 2026 06:4012,000110,417,01497,289,0002,311,0002,113,536
9May 20, 2026 06:4012,001110,684,59597,302,0002,307,0002,113,536