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 29, 2026 20:27sandheep rajkumarsandheep rajkumarScore: 93,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2026 20:2793,452797,819,353545,756,000229,897,0002,342,912
2Jan 29, 2026 20:2793,561802,816,095546,688,000229,869,0002,465,792
3Jan 29, 2026 20:2793,618804,082,613545,320,000231,711,0002,293,760
4Jan 29, 2026 20:2793,620806,676,948545,333,000231,716,0002,465,792
5Jan 29, 2026 20:2793,659801,665,269546,555,000230,812,0002,523,136
6Jan 29, 2026 20:2793,843805,348,510545,230,000233,670,0002,392,064
7Jan 29, 2026 20:2793,869806,872,468546,377,000232,734,0002,289,664
8Jan 29, 2026 20:2794,158810,227,407546,660,000234,853,0002,269,184
9Jan 29, 2026 20:2795,276826,359,048545,858,000244,936,0002,416,640