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 12:48Ashish AhujaAshish AhujaScore: 12,300Success
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 12:4812,236134,621,67482,644,00018,918,0002,408,448
2Aug 22, 2025 12:4812,300130,195,11385,243,00016,850,0002,449,408
3Aug 22, 2025 12:4812,781133,135,74286,253,00019,828,0002,392,064