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 listFeb 15, 2026 22:33wnwnScore: 10,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 22:339,23099,663,25967,536,0009,072,0002,289,664
2Feb 15, 2026 22:339,319102,796,21669,314,0008,036,0002,506,752
3Feb 15, 2026 22:339,335103,195,46869,434,0008,050,0002,371,584
4Feb 15, 2026 22:3310,899113,490,90481,416,0009,046,0002,457,600
5Feb 15, 2026 22:3311,029120,312,48484,503,0007,041,0002,269,184
6Feb 15, 2026 22:3311,366117,369,39588,320,0006,021,0002,445,312