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 18, 2025 13:09Ashish AhujaAshish AhujaScore: 10,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 13:0910,819110,372,25483,815,0005,986,0002,318,336
2Aug 18, 2025 13:0910,925115,071,06082,703,0007,971,0002,396,160
3Aug 18, 2025 13:0910,936119,054,05283,790,0006,982,0002,363,392
4Aug 18, 2025 13:0910,987115,897,93685,178,0006,012,0002,281,472
5Aug 18, 2025 13:0911,184113,257,94287,834,0004,990,0002,355,200
6Aug 18, 2025 13:0911,268118,622,64286,560,0006,964,0002,535,424