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 listJun 28, 2025 06:32Valentin KofmanValentin KofmanScore: 8,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2025 06:326,54578,887,45552,314,0002,012,0002,289,664
2Jun 28, 2025 06:326,56077,660,34554,449,00002,273,280
3Jun 28, 2025 06:326,56874,085,46453,505,0001,009,0002,289,664
4Jun 28, 2025 06:328,30492,085,18266,930,0001,997,0002,289,664
5Jun 28, 2025 06:328,31792,739,09767,031,0002,000,0002,289,664
6Jun 28, 2025 06:328,33297,032,77267,155,0002,004,0002,289,664