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 7, 2026 08:39Teow Hua JunTeow Hua JunScore: 11,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 08:4011,772107,254,06796,696,0001,016,0002,113,536
2Jul 7, 2026 08:4011,776107,141,29496,723,0001,018,0002,113,536
3Jul 7, 2026 08:4011,777107,187,65096,738,0001,018,0002,113,536
4Jul 7, 2026 08:4011,793107,355,83296,870,0001,017,0002,113,536
5Jul 7, 2026 08:4011,799107,298,79796,920,0001,018,0002,113,536
6Jul 7, 2026 08:4011,806107,550,67096,974,0001,018,0002,113,536
7Jul 7, 2026 08:4011,815107,675,40997,050,0001,018,0002,113,536
8Jul 7, 2026 08:4011,816107,592,95797,064,0001,016,0002,113,536
9Jul 7, 2026 08:4011,828107,711,34097,156,0001,018,0002,113,536