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 listSep 20, 2025 20:51SaaskaSaaskaScore: 28,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 20:5128,208261,458,061232,123,0002,001,0002,490,368
2Sep 20, 2025 20:5128,228254,639,385232,294,0002,002,0002,478,080
3Sep 20, 2025 20:5128,230261,916,233233,308,0001,001,0002,347,008
4Sep 20, 2025 20:5128,235259,776,202233,350,0001,001,0002,490,368
5Sep 20, 2025 20:5128,241255,834,861232,395,0002,003,0002,445,312
6Sep 20, 2025 20:5128,244257,201,986232,423,0002,003,0002,318,336
7Sep 20, 2025 20:5128,276266,606,245231,694,0002,996,0002,318,336
8Sep 20, 2025 20:5128,277262,787,336231,707,0002,996,0002,482,176
9Sep 20, 2025 20:5128,486268,714,195232,427,0004,007,0002,318,336