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 listJul 16, 2026 07:59wnwnScore: 3,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 07:593,70138,836,87229,692,0001,031,0002,113,536
2Jul 16, 2026 07:593,70338,676,37229,719,0001,020,0002,113,536
3Jul 16, 2026 07:593,71038,741,60129,787,0001,008,0002,113,536
4Jul 16, 2026 07:593,71038,930,38729,772,0001,021,0002,113,536
5Jul 16, 2026 07:593,72239,062,28729,875,0001,025,0002,113,536
6Jul 16, 2026 07:593,72838,816,65229,937,0001,008,0002,113,536
7Jul 16, 2026 07:593,73340,660,93229,928,0001,056,0002,113,536
8Jul 16, 2026 07:593,78539,583,02330,365,0001,056,0002,113,536
9Jul 16, 2026 07:593,87840,840,08931,152,0001,036,0002,113,536