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 listSep 8, 2025 21:10Adam FolwarcznyAdam FolwarcznyScore: 7,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2025 21:107,89990,463,79655,475,00010,086,0002,392,064
2Sep 8, 2025 21:107,96690,105,55753,094,00013,023,0002,387,968
3Sep 8, 2025 21:107,97090,212,55555,124,00011,024,0002,392,064
4Sep 8, 2025 21:107,99190,968,15751,249,00015,073,0002,392,064
5Sep 8, 2025 21:107,99789,877,78254,309,00012,068,0002,473,984
6Sep 8, 2025 21:108,05091,228,96854,847,00011,966,0002,383,872