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 31, 2026 23:57George SeabridgeGeorge SeabridgeScore: 12,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 23:5812,327112,379,591101,225,0001,092,0002,113,536
2Jul 31, 2026 23:5812,343112,459,085101,363,0001,085,0002,113,536
3Jul 31, 2026 23:5812,356112,564,962101,487,0001,075,0002,113,536
4Jul 31, 2026 23:5812,357112,624,881101,485,0001,084,0002,113,536
5Jul 31, 2026 23:5812,364112,606,424101,525,0001,101,0002,113,536
6Jul 31, 2026 23:5812,364112,675,827101,547,0001,078,0002,113,536
7Jul 31, 2026 23:5812,459113,433,217102,324,0001,093,0002,113,536
8Jul 31, 2026 23:5812,472113,571,148102,439,0001,081,0002,113,536
9Jul 31, 2026 23:5812,670115,212,561104,082,0001,079,0002,113,536