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 21, 2025 22:09Valentin KofmanValentin KofmanScore: 54,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 22:0953,978471,396,958446,016,0002,000,0002,273,280
2Jun 21, 2025 22:0954,004475,148,375448,236,00002,281,472
3Jun 21, 2025 22:0954,007474,700,785447,260,0001,000,0002,281,472
4Jun 21, 2025 22:0954,016478,214,361448,329,00002,289,664
5Jun 21, 2025 22:0954,018471,448,875448,347,00002,269,184
6Jun 21, 2025 22:0954,018475,128,616448,352,00002,281,472
7Jun 21, 2025 22:0954,027476,050,094447,424,0001,000,0002,289,664
8Jun 21, 2025 22:0954,079472,397,830446,857,0001,999,0002,273,280
9Jun 21, 2025 22:0954,081476,934,409446,872,0001,999,0002,289,664