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 listSep 5, 2024 12:59Matthew BookerMatthew BookerScore: 1,157,334Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2024 12:591,157,0649,630,057,9469,601,635,0001,999,0002,281,472
2Sep 5, 2024 12:591,157,1379,636,042,7409,603,239,000999,0002,281,472
3Sep 5, 2024 12:591,157,3159,636,752,3329,603,713,0001,999,0002,281,472
4Sep 5, 2024 12:591,157,3339,637,977,6489,604,868,000999,0002,527,232
5Sep 5, 2024 12:591,157,3349,632,000,7339,603,876,0001,999,0002,273,280
6Sep 5, 2024 12:591,157,4059,634,110,4019,604,462,0001,999,0002,379,776
7Sep 5, 2024 12:591,157,4989,634,998,6109,606,234,000999,0002,281,472
8Sep 5, 2024 12:591,158,8399,647,001,4349,616,364,0001,999,0002,281,472
9Sep 5, 2024 12:591,493,80712,431,152,42112,396,597,0001,999,0002,289,664