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 19, 2025 08:23Ashish AhujaAshish AhujaScore: 10,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2025 08:2310,351110,684,79980,922,0004,995,0002,387,968
2Aug 19, 2025 08:2310,361111,420,17682,000,0004,000,0002,461,696
3Aug 19, 2025 08:2310,392115,639,32380,235,0006,017,0002,281,472
4Aug 19, 2025 08:2310,435111,513,39479,644,0006,968,0002,289,664
5Aug 19, 2025 08:2310,558118,470,30482,652,0004,979,0002,490,368
6Aug 19, 2025 08:2310,685115,772,18281,707,0006,975,0002,375,680