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 13:53Ashish AhujaAshish AhujaScore: 11,692Success
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 13:5311,311126,283,16776,906,00016,979,0002,502,656
2Aug 22, 2025 13:5311,439131,571,75977,953,00016,989,0002,502,656
3Aug 22, 2025 13:5311,578120,576,74375,296,00020,805,0002,367,488
4Aug 22, 2025 13:5311,692122,658,78678,228,00018,814,0002,506,752
5Aug 22, 2025 13:5311,709127,073,81778,340,00018,841,0002,363,392
6Aug 22, 2025 13:5311,903121,525,77280,832,00017,962,0002,408,448