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 27, 2024 07:10alemelisalemelisScore: 1,646,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2024 07:101,646,23313,729,146,51713,663,737,13602,269,184
2Jul 27, 2024 07:101,646,40313,736,142,73713,665,143,73802,396,160
3Jul 27, 2024 07:101,646,48513,746,473,82313,665,829,10002,383,872
4Jul 27, 2024 07:101,646,90513,735,952,62613,669,310,53002,252,800
5Jul 27, 2024 07:101,647,15713,747,220,15413,671,404,79102,269,184
6Jul 27, 2024 07:101,650,91613,757,881,83013,702,599,79202,392,064