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 31, 2025 21:41Adam FolwarcznyAdam FolwarcznyScore: 10,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2025 21:4110,134110,593,18964,085,00020,026,0002,277,376
2Aug 31, 2025 21:4110,154103,343,09770,232,00014,046,0002,301,952
3Aug 31, 2025 21:4110,188111,902,28466,438,00018,119,0002,342,912
4Aug 31, 2025 21:4110,325110,644,27869,755,00015,944,0002,469,888
5Aug 31, 2025 21:4110,343112,873,13372,870,00012,976,0002,408,448
6Aug 31, 2025 21:4110,467108,950,92173,891,00012,981,0002,539,520