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 19, 2026 21:44Victor MerckléVictor MerckléScore: 13,069Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 21:4513,026115,709,256107,077,0001,046,0002,113,536
2Jun 19, 2026 21:4513,063116,045,988107,417,0001,006,0002,113,536
3Jun 19, 2026 21:4513,065116,091,050107,421,0001,024,0002,113,536
4Jun 19, 2026 21:4513,069116,128,556107,475,0001,004,0002,113,536
5Jun 19, 2026 21:4513,069116,113,963107,451,0001,028,0002,113,536
6Jun 19, 2026 21:4513,070116,073,336107,485,0001,000,0002,113,536
7Jun 19, 2026 21:4513,078117,120,851107,483,0001,072,0002,113,536
8Jun 19, 2026 21:4513,239117,784,176108,776,0001,114,0002,113,536
9Jun 19, 2026 21:4513,518119,812,997111,188,0001,016,0002,113,536