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 listFeb 7, 2026 17:06Benn TanBenn TanScore: 58,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 17:0658,829522,537,181485,283,0003,001,0002,433,024
2Feb 7, 2026 17:0658,905519,454,247484,916,0003,999,0002,445,312
3Feb 7, 2026 17:0658,924512,707,432487,066,0002,000,0002,449,408
4Feb 7, 2026 17:0658,928521,582,603485,104,0004,000,0002,441,216
5Feb 7, 2026 17:0658,932517,342,789488,133,0001,000,0002,539,520
6Feb 7, 2026 17:0658,934514,595,570486,149,0003,000,0002,441,216
7Feb 7, 2026 17:0658,934523,443,846487,151,0002,000,0002,441,216
8Feb 7, 2026 17:0658,954524,246,173487,314,0002,001,0002,445,312
9Feb 7, 2026 17:0658,981523,833,807486,547,0002,997,0002,445,312