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 26, 2025 08:28Valentin KofmanValentin KofmanScore: 8,115Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2025 08:286,24378,558,40849,824,0001,992,0002,289,664
2Jun 26, 2025 08:286,24680,598,07849,848,0001,993,0002,273,280
3Jun 26, 2025 08:286,27382,137,80850,068,0002,002,0002,260,992
4Jun 26, 2025 08:288,11595,867,26665,343,0002,010,0002,289,664
5Jun 26, 2025 08:288,13387,708,76466,494,0001,007,0002,265,088
6Jun 26, 2025 08:288,13794,007,46366,530,0001,008,0002,289,664