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 12:36Ashish AhujaAshish AhujaScore: 15,540Success
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 12:3615,506157,326,518120,716,0007,981,0002,523,136
2Aug 18, 2025 12:3615,540151,289,144121,983,0006,999,0002,367,488
3Aug 18, 2025 12:3615,559155,550,794121,129,0008,008,0002,269,184