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 listMar 2, 2026 15:31caandocaandoScore: 5,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 15:315,34167,742,64042,318,0002,015,0002,285,568
2Mar 2, 2026 15:315,34476,148,51943,348,0001,008,0002,523,136
3Mar 2, 2026 15:315,35967,598,36443,471,0001,010,0002,523,136
4Mar 2, 2026 15:315,44171,903,37743,152,0002,007,0002,285,568
5Mar 2, 2026 15:315,45869,137,45943,285,0002,013,0002,285,568
6Mar 2, 2026 15:315,47071,767,50643,426,0001,973,0002,523,136