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 listAug 2, 2026 17:35Andrey TsvetkovAndrey TsvetkovScore: 39,076Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:3739,049335,295,331322,030,0002,080,0002,138,112
2Aug 2, 2026 17:3739,067336,817,413322,061,0002,200,0002,138,112
3Aug 2, 2026 17:3739,071342,894,657322,115,0002,181,0002,138,112
4Aug 2, 2026 17:3739,072335,315,808322,158,0002,144,0002,138,112
5Aug 2, 2026 17:3739,076336,338,680322,190,0002,146,0002,138,112
6Aug 2, 2026 17:3739,079334,591,282322,172,0002,190,0002,138,112
7Aug 2, 2026 17:3739,082335,716,274322,201,0002,181,0002,138,112
8Aug 2, 2026 17:3739,082335,799,741322,138,0002,243,0002,138,112
9Aug 2, 2026 17:3739,094336,124,397322,307,0002,178,0002,138,112