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 14:13Rajarshi BasuRajarshi BasuScore: 6,484Success
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 14:136,47781,695,97053,763,00002,277,376
2Dec 6, 2025 14:136,48177,864,68250,801,0002,988,0002,347,008
3Dec 6, 2025 14:136,48279,407,74351,806,0001,992,0002,289,664
4Dec 6, 2025 14:136,48280,980,00252,808,000996,0002,289,664
5Dec 6, 2025 14:136,48384,070,80651,816,0001,992,0002,379,776
6Dec 6, 2025 14:136,48478,692,32351,821,0001,993,0002,289,664
7Dec 6, 2025 14:136,48486,392,78453,815,00002,289,664
8Dec 6, 2025 14:136,48479,907,87451,824,0001,993,0002,289,664
9Dec 6, 2025 14:136,49380,116,81551,900,0001,996,0002,289,664
10Dec 6, 2025 14:136,61079,372,93651,871,0002,992,0002,289,664
11Dec 6, 2025 14:136,61576,783,85252,912,0001,996,0002,289,664
12Dec 6, 2025 14:136,61978,906,95652,938,0001,997,0002,269,184