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 13:14Rajarshi BasuRajarshi BasuScore: 9,252Success
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 13:149,111101,681,54574,611,0001,008,0002,465,792
2Dec 4, 2025 13:149,14598,016,65073,903,0001,997,0002,289,664
3Dec 4, 2025 13:149,168104,272,47575,092,0001,001,0002,469,888
4Dec 4, 2025 13:149,252106,299,41875,793,000997,0002,289,664
5Dec 4, 2025 13:149,256106,770,18875,826,000997,0002,465,792
6Dec 4, 2025 13:149,26094,369,89174,858,0001,996,0002,289,664