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 11:37George SeabridgeGeorge SeabridgeScore: 81,680Success
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 11:3881,466686,174,743675,004,0001,165,0002,117,632
2Jul 31, 2026 11:3881,503686,518,610675,355,0001,127,0002,117,632
3Jul 31, 2026 11:3881,570686,993,165675,869,0001,162,0002,117,632
4Jul 31, 2026 11:3881,671687,893,420676,727,0001,148,0002,117,632
5Jul 31, 2026 11:3881,680688,046,522676,942,0001,002,0002,117,632
6Jul 31, 2026 11:3881,683688,055,406676,828,0001,143,0002,117,632
7Jul 31, 2026 11:3881,792688,889,376677,812,0001,065,0002,117,632
8Jul 31, 2026 11:3881,837689,359,301678,245,0001,008,0002,117,632
9Jul 31, 2026 11:3881,918689,985,217678,737,0001,184,0002,117,632