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 27, 2025 18:15Josu San MartinJosu San MartinScore: 32,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 18:1532,523296,016,475268,938,000999,0002,355,200
2Dec 27, 2025 18:1532,551297,167,525268,171,0002,001,0002,359,296
3Dec 27, 2025 18:1532,579293,055,225269,401,0001,001,0002,355,200
4Dec 27, 2025 18:1532,587296,290,661270,471,00002,375,680
5Dec 27, 2025 18:1532,614300,162,464269,701,000998,0002,363,392
6Dec 27, 2025 18:1532,616296,711,496269,717,000998,0002,359,296
7Dec 27, 2025 18:1532,620297,924,654268,746,0001,998,0002,355,200
8Dec 27, 2025 18:1532,648295,242,762269,982,000999,0002,289,664
9Dec 27, 2025 18:1532,658308,097,144269,065,0002,000,0002,363,392