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 10, 2026 13:55Victor MerckléVictor MerckléScore: 4,590Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 13:564,54951,441,81936,631,0001,128,0002,113,536
2Jun 10, 2026 13:564,56845,545,62636,916,0001,001,0002,113,536
3Jun 10, 2026 13:564,57045,582,86736,928,0001,005,0002,113,536
4Jun 10, 2026 13:564,57145,567,69036,871,0001,075,0002,113,536
5Jun 10, 2026 13:564,59045,686,87237,041,0001,064,0002,113,536
6Jun 10, 2026 13:564,60145,789,43337,111,0001,085,0002,113,536
7Jun 10, 2026 13:564,64046,109,78137,435,0001,079,0002,113,536
8Jun 10, 2026 13:564,66346,495,73837,669,0001,041,0002,113,536
9Jun 10, 2026 13:564,79447,148,99238,766,0001,032,0002,113,536