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 listNov 25, 2025 08:12Ham-HamHam-HamScore: 72,888Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2025 08:1271,964623,896,867509,407,00087,897,0002,355,200
2Nov 25, 2025 08:1472,003626,444,849511,676,00085,945,0002,347,008
3Nov 25, 2025 08:1472,199629,425,050506,371,00092,884,0002,424,832
4Nov 25, 2025 08:1472,888629,063,776511,973,00092,995,0002,359,296
5Nov 25, 2025 08:1273,021637,833,239514,061,00092,011,0002,441,216
6Nov 25, 2025 08:1273,064630,719,786514,518,00091,914,0002,387,968