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 listJan 30, 2026 20:01olliecrowolliecrowScore: 11,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 20:0111,540122,086,29193,784,0001,995,0002,289,664
2Jan 30, 2026 20:0111,579122,057,44293,101,0003,003,0002,265,088
3Jan 30, 2026 20:0111,707124,829,73194,167,0003,005,0002,289,664
4Jan 30, 2026 20:0111,741120,728,13695,445,0002,009,0002,510,848
5Jan 30, 2026 20:0111,744124,798,19396,474,0001,004,0002,293,760
6Jan 30, 2026 20:0111,758127,806,57295,578,0002,012,0002,293,760