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 29, 2025 10:53Aman | अमनAman | अमनScore: 54,898Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 10:5354,835479,179,114451,128,0004,001,0002,379,776
2Dec 29, 2025 10:5354,841477,549,237455,183,00002,519,040
3Dec 29, 2025 10:5354,862477,576,048454,357,0001,000,0002,379,776
4Dec 29, 2025 10:5354,891486,341,035453,597,0001,998,0002,519,040
5Dec 29, 2025 10:5354,898481,163,844454,656,000999,0002,510,848
6Dec 29, 2025 10:5354,900485,942,766454,670,000999,0002,387,968
7Dec 29, 2025 10:5354,900483,227,801455,666,00002,510,848
8Dec 29, 2025 10:5354,920483,932,722454,835,000999,0002,510,848
9Dec 29, 2025 10:5354,922480,079,068453,851,0001,999,0002,387,968