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 listMar 18, 2026 12:13shartgepettoshartgepettoScore: 6,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 12:136,00278,486,04745,829,0003,985,0002,478,080
2Mar 18, 2026 12:136,00373,707,34846,840,0002,989,0002,469,888
3Mar 18, 2026 12:136,02273,648,62545,984,0003,998,0002,379,776
4Mar 18, 2026 12:136,03771,916,08948,104,0002,004,0002,494,464
5Mar 18, 2026 12:136,04477,381,92647,158,0003,010,0002,457,600
6Mar 18, 2026 12:136,06277,939,13847,298,0003,019,0002,478,080
7Mar 18, 2026 12:136,09678,488,55046,550,0004,047,0002,392,064
8Mar 18, 2026 12:136,19878,547,88247,409,0004,034,0002,371,584
9Mar 18, 2026 12:136,42081,194,46550,271,0003,016,0002,498,560