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 29, 2026 08:21Danylo MocherniukDanylo MocherniukScore: 56,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 08:1956,582500,149,985469,629,00002,502,656
2Mar 29, 2026 08:1956,601493,597,392467,789,0001,999,0002,506,752
3Mar 29, 2026 08:1956,606498,202,315467,829,0001,999,0002,293,760
4Mar 29, 2026 08:1956,610491,083,247468,867,000999,0002,285,568
5Mar 29, 2026 08:1956,618494,041,784467,932,0001,999,0002,506,752
6Mar 29, 2026 08:2156,618496,843,455468,933,000999,0002,293,760
7Mar 29, 2026 08:1956,624491,768,886468,979,000999,0002,293,760
8Mar 29, 2026 08:1956,629495,921,072469,018,0001,000,0002,293,760
9Mar 29, 2026 08:2156,630494,592,588469,027,0001,000,0002,494,464
10Mar 29, 2026 08:2156,652495,182,563468,211,0002,000,0002,293,760
11Mar 29, 2026 08:1956,665499,002,421468,322,0002,001,0002,289,664
12Mar 29, 2026 08:1956,694496,781,594470,557,00002,498,560