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:59Rajarshi BasuRajarshi BasuScore: 6,665Success
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:596,51382,568,79951,053,0003,003,0002,289,664
2Dec 6, 2025 11:596,52178,545,57152,118,0002,004,0002,289,664
3Dec 6, 2025 11:596,52384,894,05252,136,0002,005,0002,289,664
4Dec 6, 2025 11:596,66584,196,32452,299,0003,017,0002,289,664
5Dec 6, 2025 11:596,67782,977,31754,410,0001,007,0002,289,664
6Dec 6, 2025 11:596,70486,058,88554,633,0001,011,0002,289,664