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 9, 2026 12:54wnwnScore: 3,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 12:543,39645,421,84927,130,0001,058,0002,482,176
2May 9, 2026 12:543,41040,836,85427,280,0001,023,0002,482,176
3May 9, 2026 12:543,51743,797,82228,127,0001,072,0002,486,272
4May 9, 2026 12:543,53747,465,76028,297,0001,067,0002,486,272
5May 9, 2026 12:543,55446,714,50228,397,0001,106,0002,490,368
6May 9, 2026 12:543,56043,866,35728,483,0001,069,0002,494,464
7May 9, 2026 12:543,57643,944,13328,581,0001,106,0002,482,176
8May 9, 2026 12:543,58045,563,52328,624,0001,094,0002,482,176
9May 9, 2026 12:543,58144,479,32628,636,0001,088,0002,494,464