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 8, 2026 17:45Jora BabayanJora BabayanScore: 35,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 17:4735,370302,771,144292,572,0001,003,0002,113,536
2Jun 8, 2026 17:4735,380302,812,381292,658,0001,003,0002,113,536
3Jun 8, 2026 17:4735,382302,740,031292,674,0001,002,0002,113,536
4Jun 8, 2026 17:4735,383302,864,429292,680,0001,003,0002,113,536
5Jun 8, 2026 17:4735,388303,625,981292,721,0001,003,0002,113,536
6Jun 8, 2026 17:4735,390302,870,760292,736,0001,004,0002,113,536
7Jun 8, 2026 17:4735,391302,862,363292,741,0001,005,0002,113,536
8Jun 8, 2026 17:4735,392302,852,396292,752,0001,004,0002,113,536
9Jun 8, 2026 17:4735,411303,048,806292,910,0001,004,0002,113,536