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 19, 2021 20:08Yuriy LyfenkoYuriy LyfenkoScore: 17,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2021 20:0817,5303,022,649,609144,497,0001,003,0002,523,136
2May 19, 2021 20:0817,5341,899,237,736143,536,0001,993,0002,265,088
3May 19, 2021 20:0817,5371,781,521,128143,565,0001,993,0002,527,232
4May 19, 2021 20:0817,543917,676,623144,614,000997,0002,260,992
5May 19, 2021 20:0817,549921,837,232143,665,0001,995,0002,265,088
6May 19, 2021 20:0817,5501,254,605,727143,669,0001,995,0002,256,896
7May 19, 2021 20:0817,5521,553,314,326145,678,00002,260,992
8May 19, 2021 20:0817,5551,088,018,925142,714,0002,994,0002,519,040
9May 19, 2021 20:0817,556937,788,581141,723,0003,992,0002,523,136
10May 19, 2021 20:0818,0052,681,495,193149,442,70502,433,024
11May 19, 2021 20:0818,017445,449,122149,542,47702,269,184
12May 19, 2021 20:0818,0231,809,540,663149,589,85202,273,280