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 listOct 22, 2025 13:00Jeongbong SeoJeongbong SeoScore: 65,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 22, 2025 13:0064,961565,437,208539,174,00002,387,968
2Oct 22, 2025 13:0065,014569,927,876537,621,0001,998,0002,260,992
3Oct 22, 2025 13:0065,026564,659,975537,715,0001,998,0002,256,896
4Oct 22, 2025 13:0065,038563,898,777538,817,000999,0002,260,992
5Oct 22, 2025 13:0065,051563,170,599538,922,000999,0002,375,680
6Oct 22, 2025 13:0065,078571,103,783539,146,0001,000,0002,519,040
7Oct 22, 2025 13:0065,078567,398,463539,149,0001,000,0002,519,040
8Oct 22, 2025 13:0065,085564,146,184539,209,0001,000,0002,387,968
9Oct 22, 2025 13:0065,103571,500,597540,358,00002,256,896