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 listAug 5, 2025 23:39Leon ZhaoLeon ZhaoScore: 48,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2025 23:3948,154423,626,843397,681,0001,998,0002,519,040
2Aug 5, 2025 23:3948,172425,791,669398,829,000999,0002,379,776
3Aug 5, 2025 23:3948,199421,052,778398,054,0002,000,0002,260,992
4Aug 5, 2025 23:3948,207425,919,652399,119,0001,000,0002,392,064
5Aug 5, 2025 23:3948,209423,577,064399,131,0001,000,0002,519,040
6Aug 5, 2025 23:3948,272429,711,390399,662,000999,0002,510,848
7Aug 5, 2025 23:3948,275429,478,642398,684,0001,998,0002,510,848
8Aug 5, 2025 23:3948,278431,836,309398,710,0001,998,0002,519,040
9Aug 5, 2025 23:3948,444432,523,347400,089,0002,000,0002,379,776