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 listMay 10, 2026 11:01wnwnScore: 3,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 11:023,38144,558,49027,016,0001,049,0002,478,080
2May 10, 2026 11:023,39044,315,95727,054,0001,088,0002,494,464
3May 10, 2026 11:023,39243,900,68927,093,0001,065,0002,486,272
4May 10, 2026 11:023,40046,961,69527,159,0001,065,0002,494,464
5May 10, 2026 11:023,40544,601,92227,168,0001,101,0002,494,464
6May 10, 2026 11:023,45843,117,61327,630,0001,077,0002,490,368
7May 10, 2026 11:023,55944,312,82228,497,0001,048,0002,478,080
8May 10, 2026 11:023,56449,036,27828,491,0001,091,0002,486,272
9May 10, 2026 11:023,57544,938,06828,597,0001,081,0002,482,176