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:27Adam FolwarcznyAdam FolwarcznyScore: 15,416Success
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:2815,110134,784,462124,418,0001,003,0002,113,536
2Jun 29, 2026 10:2815,158135,176,185124,645,0001,168,0002,113,536
3Jun 29, 2026 10:2815,227135,768,718125,209,0001,178,0002,113,536
4Jun 29, 2026 10:2815,370136,870,379126,577,0001,002,0002,113,536
5Jun 29, 2026 10:2815,416137,272,775126,788,0001,166,0002,113,536
6Jun 29, 2026 10:2815,432137,374,613126,931,0001,156,0002,113,536
7Jun 29, 2026 10:2815,490137,929,455127,403,0001,164,0002,113,536
8Jun 29, 2026 10:2815,503137,989,576127,523,0001,153,0002,113,536
9Jun 29, 2026 10:2815,513138,099,150127,613,0001,148,0002,113,536