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 10, 2026 13:38wnwnScore: 3,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:393,25135,930,70626,987,00002,113,536
2May 10, 2026 13:393,25336,018,48827,007,00002,113,536
3May 10, 2026 13:393,25436,339,49527,011,00002,113,536
4May 10, 2026 13:393,25637,215,21527,031,00002,113,536
5May 10, 2026 13:393,26936,089,74427,138,00002,113,536
6May 10, 2026 13:393,27436,760,04927,181,00002,113,536
7May 10, 2026 13:393,38535,248,28628,101,00002,113,536
8May 10, 2026 13:393,38835,853,22228,121,00002,113,536
9May 10, 2026 13:393,43036,060,89028,473,00002,113,536