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:08Rajarshi BasuRajarshi BasuScore: 54,897Success
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:0852,276464,349,461431,893,0001,999,0002,519,040
2Dec 4, 2025 19:0854,897487,943,379453,651,0001,998,0002,527,232
3Dec 4, 2025 19:0855,615490,256,110461,603,00002,265,088