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 11:01Rajarshi BasuRajarshi BasuScore: 7,881Success
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 11:017,70093,758,05861,917,0001,997,0002,289,664
2Dec 6, 2025 11:017,82489,906,09062,938,0001,998,0002,289,664
3Dec 6, 2025 11:017,83190,344,76563,001,0002,000,0002,289,664
4Dec 6, 2025 11:017,88190,485,02163,404,0002,012,0002,289,664
5Dec 6, 2025 11:017,89892,978,06063,565,0001,986,0002,273,280
6Dec 6, 2025 11:018,00688,794,20464,440,0002,013,0002,289,664