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:15Rajarshi BasuRajarshi BasuScore: 6,361Success
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:156,17374,584,68249,225,0002,009,0002,289,664
2Dec 6, 2025 15:156,19275,727,15249,378,0002,015,0002,289,664
3Dec 6, 2025 15:156,24377,863,17850,819,000996,0002,289,664
4Dec 6, 2025 15:156,36178,614,17650,801,0001,992,0002,289,664
5Dec 6, 2025 15:156,36382,549,76051,817,000996,0002,289,664
6Dec 6, 2025 15:156,40083,005,28751,114,0002,004,0002,289,664