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 listFeb 3, 2025 15:51AdityaAdityaScore: 64,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 15:5264,632564,245,000534,443,0002,001,0002,281,472
2Feb 3, 2025 15:5164,637567,146,708532,491,0003,996,0002,510,848
3Feb 3, 2025 15:5164,648563,177,492534,580,0001,998,0002,510,848
4Feb 3, 2025 15:5264,651564,865,652534,608,0001,998,0002,506,752
5Feb 3, 2025 15:5164,659563,324,145534,675,0001,998,0002,281,472
6Feb 3, 2025 15:5164,660562,362,347534,676,0001,998,0002,281,472
7Feb 3, 2025 15:5164,672570,216,329534,782,0001,999,0002,281,472
8Feb 3, 2025 15:5264,715563,420,552535,135,0002,000,0002,281,472
9Feb 3, 2025 15:5164,738561,054,005536,322,0001,000,0002,281,472