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 listDec 6, 2025 15:11Rajarshi BasuRajarshi BasuScore: 6,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2025 15:116,19477,778,66949,393,0002,016,0002,269,184
2Dec 6, 2025 15:116,20778,223,75550,505,0001,010,0002,289,664
3Dec 6, 2025 15:116,29879,753,19949,257,0003,015,0002,289,664
4Dec 6, 2025 15:116,33875,244,57951,597,0001,011,0002,277,376
5Dec 6, 2025 15:116,34079,411,85651,614,0001,012,0002,289,664
6Dec 6, 2025 15:116,36378,811,80851,820,000996,0002,289,664