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 29, 2025 22:22Alexander KovalyovAlexander KovalyovScore: 53,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2025 22:2253,478468,278,109441,869,0001,999,0002,273,280
2Oct 29, 2025 22:2253,490471,622,682441,966,0001,999,0002,260,992
3Oct 29, 2025 22:2253,494472,860,934442,998,000999,0002,273,280
4Oct 29, 2025 22:2253,525473,718,060442,254,0002,001,0002,273,280
5Oct 29, 2025 22:2253,532475,146,188443,312,0001,000,0002,265,088
6Oct 29, 2025 22:2253,535471,074,643443,341,0001,000,0002,273,280
7Oct 29, 2025 22:2253,543470,418,709444,406,00002,273,280
8Oct 29, 2025 22:2253,543470,589,807441,406,0003,002,0002,273,280
9Oct 29, 2025 22:2253,597465,658,907441,856,0002,999,0002,342,912