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 listMay 7, 2026 10:05wnwnScore: 3,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 10:063,37544,362,72926,954,0001,062,0002,490,368
2May 7, 2026 10:063,37942,751,27326,991,0001,060,0002,482,176
3May 7, 2026 10:063,38241,558,58427,000,0001,072,0002,478,080
4May 7, 2026 10:063,38942,968,43127,068,0001,066,0002,494,464
5May 7, 2026 10:063,40143,122,90627,167,0001,067,0002,486,272
6May 7, 2026 10:063,40244,659,13527,155,0001,089,0002,486,272
7May 7, 2026 10:063,53745,614,20928,273,0001,087,0002,482,176
8May 7, 2026 10:063,56744,377,23728,520,0001,087,0002,486,272
9May 7, 2026 10:063,58044,751,72228,650,0001,071,0002,490,368