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 29, 2026 10:03Adam FolwarcznyAdam FolwarcznyScore: 22,999Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 10:0322,513196,241,328185,683,0001,176,0002,113,536
2Jun 29, 2026 10:0322,927199,606,084189,289,0001,013,0002,113,536
3Jun 29, 2026 10:0322,968199,937,703189,475,0001,163,0002,113,536
4Jun 29, 2026 10:0322,982200,049,451189,750,0001,001,0002,113,536
5Jun 29, 2026 10:0322,999200,236,992189,712,0001,180,0002,113,536
6Jun 29, 2026 10:0323,003200,342,217189,901,0001,026,0002,113,536
7Jun 29, 2026 10:0323,008200,334,867189,800,0001,167,0002,113,536
8Jun 29, 2026 10:0323,024200,500,602190,092,0001,009,0002,113,536
9Jun 29, 2026 10:0323,966208,229,842197,757,0001,165,0002,113,536