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 06:50Ashish AhujaAshish AhujaScore: 11,381Success
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 06:5011,245125,321,36983,403,0009,928,0002,277,376
2Aug 18, 2025 06:5011,269122,312,46686,571,0006,965,0002,281,472
3Aug 18, 2025 06:5011,347128,247,81387,237,0006,939,0002,531,328
4Aug 18, 2025 06:5011,381122,041,46386,511,0007,955,0002,273,280
5Aug 18, 2025 06:5011,501124,575,43388,498,0006,960,0002,441,216
6Aug 18, 2025 06:5011,883124,821,04689,660,0008,966,0002,531,328