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 listJan 17, 2022 00:27Yuriy LyfenkoYuriy LyfenkoScore: 29,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2022 00:2729,705301,668,132246,549,97802,220,032
2Jan 17, 2022 00:2729,711304,463,165246,604,22702,215,936
3Jan 17, 2022 00:2729,717298,780,974246,655,24702,211,840
4Jan 17, 2022 00:2729,728273,661,362243,743,0002,996,0002,531,328
5Jan 17, 2022 00:2729,728271,980,650243,748,0002,996,0002,326,528
6Jan 17, 2022 00:2729,730282,842,019243,758,0002,997,0002,527,232
7Jan 17, 2022 00:2729,730270,426,880243,765,0002,997,0002,527,232
8Jan 17, 2022 00:2729,730273,097,623243,763,0002,997,0002,326,528
9Jan 17, 2022 00:2729,732271,250,051243,782,0002,997,0002,322,432
10Jan 17, 2022 00:2729,745274,069,773243,887,0002,998,0002,527,232
11Jan 17, 2022 00:2729,750270,644,625244,924,0001,999,0002,527,232
12Jan 17, 2022 00:2729,755270,854,890243,964,0002,999,0002,326,528