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 listDec 6, 2025 14:15Rajarshi BasuRajarshi BasuScore: 6,427Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 14:156,41183,353,44251,202,0002,007,0002,367,488
2Dec 6, 2025 14:156,41378,383,31251,218,0002,008,0002,531,328
3Dec 6, 2025 14:186,41780,260,87351,252,0002,009,0002,289,664
4Dec 6, 2025 14:186,42778,576,45552,339,0001,006,0002,289,664
5Dec 6, 2025 14:186,45681,352,09151,566,0002,022,0002,289,664
6Dec 6, 2025 14:156,49678,235,58751,919,0001,996,0002,289,664