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 listMay 10, 2026 07:44Josu San MartinJosu San MartinScore: 4,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 07:444,21249,401,83533,924,0001,037,0002,490,368
2May 10, 2026 07:444,21750,611,94833,968,0001,036,0002,490,368
3May 10, 2026 07:444,22247,546,45634,012,0001,036,0002,482,176
4May 10, 2026 07:444,23049,078,50134,077,0001,039,0002,490,368
5May 10, 2026 07:444,23151,175,27034,087,0001,037,0002,486,272
6May 10, 2026 07:444,23147,444,38934,076,0001,042,0002,490,368
7May 10, 2026 07:444,23350,409,51734,101,0001,039,0002,482,176
8May 10, 2026 07:444,24151,108,32734,165,0001,040,0002,490,368
9May 10, 2026 07:444,24453,368,82534,184,0001,043,0002,490,368