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:58wnwnScore: 3,721Success
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:583,69838,911,49529,665,0001,034,0002,113,536
2Jul 16, 2026 07:583,70138,867,22429,691,0001,032,0002,113,536
3Jul 16, 2026 07:583,71038,700,52229,763,0001,036,0002,113,536
4Jul 16, 2026 07:583,71638,795,51229,848,0001,003,0002,113,536
5Jul 16, 2026 07:583,72138,871,65229,814,0001,071,0002,113,536
6Jul 16, 2026 07:583,72238,858,86429,864,0001,032,0002,113,536
7Jul 16, 2026 07:583,74038,922,42630,022,0001,024,0002,113,536
8Jul 16, 2026 07:583,81839,632,61030,685,0001,005,0002,113,536
9Jul 16, 2026 07:583,88040,890,08131,206,0001,001,0002,113,536