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 listDec 8, 2025 00:32Shikhar SoniShikhar SoniScore: 86,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 00:3286,163739,821,225496,414,000218,741,0002,383,872
2Dec 8, 2025 00:3286,274744,117,995497,358,000218,718,0002,314,240
3Dec 8, 2025 00:3286,407742,884,928498,432,000218,750,0002,265,088
4Dec 8, 2025 00:3286,420747,666,990496,506,000220,780,0002,301,952
5Dec 8, 2025 00:3286,822749,878,853496,741,000223,883,0002,424,832
6Dec 8, 2025 00:3286,836750,787,853495,820,000224,918,0002,437,120
7Dec 8, 2025 00:3287,110757,016,580498,008,000225,003,0002,437,120
8Dec 8, 2025 00:3287,140753,231,472496,493,000226,768,0002,400,256
9Dec 8, 2025 00:3287,299749,230,474496,712,000227,868,0002,289,664