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 16, 2026 01:00Victor MerckléVictor MerckléScore: 6,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 01:006,94766,171,35456,644,0001,022,0002,113,536
2May 16, 2026 01:006,94867,047,93256,653,0001,020,0002,113,536
3May 16, 2026 01:006,94967,166,55157,684,00002,113,536
4May 16, 2026 01:006,95067,880,90156,670,0001,017,0002,113,536
5May 16, 2026 01:006,95065,090,10756,647,0001,043,0002,113,536
6May 16, 2026 01:006,99765,447,25857,005,0001,075,0002,113,536
7May 16, 2026 01:007,01467,393,48757,209,0001,015,0002,113,536
8May 16, 2026 01:007,01467,118,13857,203,0001,019,0002,113,536
9May 16, 2026 01:007,02565,703,69657,298,0001,016,0002,113,536