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:32Rajarshi BasuRajarshi BasuScore: 6,191Success
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:326,16972,697,56549,192,0002,007,0002,396,160
2Dec 6, 2025 15:326,17278,174,67749,216,0002,008,0002,289,664
3Dec 6, 2025 15:326,17979,202,95549,273,0002,011,0002,289,664
4Dec 6, 2025 15:326,19172,215,02548,367,0003,022,0002,273,280
5Dec 6, 2025 15:326,20173,958,31849,447,0002,018,0002,273,280
6Dec 6, 2025 15:326,32781,228,94351,501,0001,009,0002,289,664