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 2, 2021 18:44Yuriy LyfenkoYuriy LyfenkoScore: 17,516Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2021 18:4417,398704,688,035144,402,21202,244,608
2Jun 2, 2021 18:4417,402702,916,650144,436,97702,244,608
3Jun 2, 2021 18:4417,414710,893,454144,536,27102,277,376
4Jun 2, 2021 18:4417,503670,046,963144,270,0001,001,0002,523,136
5Jun 2, 2021 18:4417,505673,412,702144,293,0001,002,0002,265,088
6Jun 2, 2021 18:4417,513677,497,774145,360,00002,523,136
7Jun 2, 2021 18:4417,516671,685,669145,379,00002,260,992
8Jun 2, 2021 18:4417,517676,133,224144,387,0001,002,0002,260,992
9Jun 2, 2021 18:4417,518672,900,669145,399,00002,260,992
10Jun 2, 2021 18:4417,519673,338,953144,409,0001,002,0002,260,992
11Jun 2, 2021 18:4417,524669,873,382145,446,00002,387,968
12Jun 2, 2021 18:4417,536678,496,494143,558,0001,993,0002,256,896