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 26, 2025 08:35Ashish AhujaAshish AhujaScore: 11,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2025 08:3511,106123,083,50471,363,00020,814,0002,502,656
2Aug 26, 2025 08:3511,294119,832,15874,795,00018,948,0002,281,472
3Aug 26, 2025 08:3511,319130,679,70475,959,00017,990,0002,490,368
4Aug 26, 2025 08:3511,338127,981,28176,277,00017,831,0002,289,664
5Aug 26, 2025 08:3511,341121,584,27379,270,00014,863,0002,453,504
6Aug 26, 2025 08:3511,681127,115,67977,962,00018,990,0002,502,656