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 30, 2021 21:29Yuriy LyfenkoYuriy LyfenkoScore: 14,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2021 21:2914,459425,248,652120,013,56302,244,608
2Jun 30, 2021 21:2914,492434,524,654120,287,67802,273,280
3Jun 30, 2021 21:2914,502424,837,337120,362,63702,273,280
4Jun 30, 2021 21:2914,702401,661,345120,029,0002,000,0002,260,992
5Jun 30, 2021 21:2914,706394,414,352120,056,0002,000,0002,523,136
6Jun 30, 2021 21:2914,710398,452,197120,096,0002,001,0002,260,992
7Jun 30, 2021 21:2914,714402,676,533121,124,0001,001,0002,260,992
8Jun 30, 2021 21:2914,718397,645,759121,156,0001,001,0002,260,992
9Jun 30, 2021 21:2914,724397,256,102121,210,0001,001,0002,523,136
10Jun 30, 2021 21:2914,726397,515,531121,221,0001,001,0002,260,992
11Jun 30, 2021 21:2914,731395,699,691122,270,00002,260,992
12Jun 30, 2021 21:2914,737394,515,752122,313,00002,260,992