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 28, 2025 23:50Josu San MartinJosu San MartinScore: 35,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2025 23:5035,220314,189,837291,321,0001,001,0002,277,376
2Dec 27, 2025 20:5135,232327,797,248292,426,00002,277,376
3Dec 27, 2025 20:5135,241319,335,918291,502,0001,001,0002,293,760
4Dec 28, 2025 23:5035,259323,710,611291,648,000998,0002,285,568
5Dec 28, 2025 23:5035,266318,764,837290,707,0001,997,0002,293,760
6Dec 27, 2025 20:5135,274316,834,708290,773,0001,998,0002,273,280