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 4, 2025 19:07Rajarshi BasuRajarshi BasuScore: 50,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 19:0749,762446,092,351411,026,0002,000,0002,265,088
2Dec 4, 2025 19:0750,950454,780,981420,885,0001,999,0002,265,088
3Dec 4, 2025 19:0752,201459,439,858433,270,00002,277,376