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 24, 2026 22:36Victor MerckléVictor MerckléScore: 4,498Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 22:374,48044,811,86936,075,0001,111,0002,113,536
2Jun 24, 2026 22:374,48845,267,29536,182,0001,074,0002,113,536
3Jun 24, 2026 22:374,49344,759,02836,195,0001,103,0002,113,536
4Jun 24, 2026 22:374,49444,744,45436,176,0001,127,0002,113,536
5Jun 24, 2026 22:374,49844,863,26936,206,0001,135,0002,113,536
6Jun 24, 2026 22:374,49844,785,25236,298,0001,036,0002,113,536
7Jun 24, 2026 22:374,52745,023,66036,563,0001,017,0002,113,536
8Jun 24, 2026 22:374,53845,083,87036,595,0001,077,0002,113,536
9Jun 24, 2026 22:374,73547,144,86738,249,0001,052,0002,113,536