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 22, 2025 12:35thatmagicalcatthatmagicalcatScore: 52,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 12:3552,387459,112,027433,811,000999,0002,285,568
2Jun 22, 2025 12:3552,461464,644,426434,427,0001,000,0002,367,488
3Jun 22, 2025 12:3552,481462,618,947434,593,000999,0002,285,568
4Jun 22, 2025 12:3552,482464,907,387433,600,0001,998,0002,285,568
5Jun 22, 2025 12:3552,482461,495,038435,600,00002,289,664
6Jun 22, 2025 12:3552,484466,212,265434,617,000999,0002,355,200
7Jun 22, 2025 12:3552,484462,686,539434,621,000999,0002,289,664
8Jun 22, 2025 12:3552,487465,893,099434,642,000999,0002,289,664
9Jun 22, 2025 12:3552,575463,001,911435,369,0001,000,0002,289,664