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 listJun 19, 2025 08:52SherzodSherzodScore: 98,001Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2025 08:5297,815839,223,713752,875,00058,990,0002,322,432
2Jun 19, 2025 08:5297,897841,755,371752,582,00059,966,0002,322,432
3Jun 19, 2025 08:5297,952838,450,713750,928,00062,076,0002,428,928
4Jun 19, 2025 08:5297,981836,753,765750,300,00062,941,0002,322,432
5Jun 19, 2025 08:5298,001843,547,245748,458,00064,953,0002,433,024
6Jun 19, 2025 08:5298,105840,374,903755,322,00058,947,0002,412,544
7Jun 19, 2025 08:5298,199842,268,957751,047,00064,004,0002,375,680
8Jun 19, 2025 08:5298,282841,155,272748,760,00066,978,0002,281,472
9Jun 19, 2025 08:5298,440852,634,148751,130,00065,923,0002,375,680