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 4, 2026 17:06caandocaandoScore: 5,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 17:065,53076,700,09142,906,0002,993,0002,289,664
2Mar 4, 2026 17:065,55475,343,82544,098,0002,004,0002,289,664
3Mar 4, 2026 17:065,57174,100,38644,227,0002,010,0002,506,752
4Mar 4, 2026 17:065,58869,155,79245,370,0001,008,0002,260,992
5Mar 4, 2026 17:065,60066,768,01145,471,0001,010,0002,285,568
6Mar 4, 2026 17:065,88977,561,14245,886,0002,992,0002,523,136