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 listAug 22, 2025 22:21Ashish AhujaAshish AhujaScore: 11,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 22:2111,236120,674,28871,433,00021,826,0002,506,752
2Aug 22, 2025 22:2111,347126,501,72673,362,00020,819,0002,424,832
3Aug 22, 2025 22:2111,424132,058,07373,857,00020,959,0002,506,752
4Aug 22, 2025 22:2111,525125,748,81276,726,00018,932,0002,420,736
5Aug 22, 2025 22:2111,605127,385,32975,466,00020,852,0002,502,656
6Aug 22, 2025 22:2111,722122,687,82878,431,00018,863,0002,375,680