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 listJan 25, 2025 16:12Giacomo StevanatoGiacomo StevanatoScore: 32,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 16:1232,147291,149,839265,824,000999,0002,363,392
2Jan 25, 2025 16:1232,150296,849,774264,843,0001,998,0002,363,392
3Jan 25, 2025 16:1232,150295,392,480264,848,0001,998,0002,367,488
4Jan 25, 2025 16:1232,151290,265,291265,855,000999,0002,367,488
5Jan 25, 2025 16:1232,158293,129,023265,914,000999,0002,289,664
6Jan 25, 2025 16:1232,167293,498,667264,985,0001,999,0002,371,584
7Jan 25, 2025 16:1232,168297,049,378264,999,0001,999,0002,351,104
8Jan 25, 2025 16:1232,174296,741,903265,047,0002,000,0002,289,664
9Jan 25, 2025 16:1233,780303,296,078279,376,0001,001,0002,363,392