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:05Ashish AhujaAshish AhujaScore: 11,627Success
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:0511,474120,443,25289,223,0006,015,0002,347,008
2Aug 18, 2025 06:0511,493124,244,57586,356,0009,037,0002,314,240
3Aug 18, 2025 06:0511,510121,876,50487,569,0007,960,0002,342,912
4Aug 18, 2025 06:0511,627121,445,37791,526,0004,974,0002,351,104
5Aug 18, 2025 06:0511,627124,998,23386,555,0009,948,0002,486,272
6Aug 18, 2025 06:0511,639128,800,23487,644,0008,963,0002,326,528
7Aug 18, 2025 06:0511,747128,005,95789,543,0007,959,0002,519,040
8Aug 18, 2025 06:0511,783119,976,74191,808,0005,987,0002,314,240
9Aug 18, 2025 06:0511,828119,372,96090,160,0008,014,0002,342,912