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, 2025 20:30Jack FrigaardJack FrigaardScore: 4,774Success
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, 2025 20:304,68760,733,14936,904,0001,994,0002,453,504
2Aug 2, 2025 20:304,69162,034,12135,940,0002,995,0002,519,040
3Aug 2, 2025 20:304,69660,673,02735,981,0002,998,0002,519,040
4Aug 2, 2025 20:304,77466,261,06038,606,0001,015,0002,519,040
5Aug 2, 2025 20:304,77464,738,97738,612,0001,016,0002,519,040
6Aug 2, 2025 20:304,77467,322,22438,609,0001,016,0002,437,120