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 14:36Yuriy LyfenkoYuriy LyfenkoScore: 27,295Success
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 14:3627,275258,617,068224,381,0002,003,0002,543,616
2Jan 17, 2022 14:3627,277249,785,352224,399,0002,003,0002,543,616
3Jan 17, 2022 14:3627,282251,234,913225,438,0001,001,0002,281,472
4Jan 17, 2022 14:3627,285252,787,425225,465,0001,002,0002,543,616
5Jan 17, 2022 14:3627,292258,970,369225,518,0001,002,0002,461,696
6Jan 17, 2022 14:3627,294255,262,344224,536,0002,004,0002,330,624
7Jan 17, 2022 14:3627,295280,930,048226,547,24602,191,360
8Jan 17, 2022 14:3627,295253,541,136223,557,0002,994,0002,281,472
9Jan 17, 2022 14:3627,298291,213,730226,570,82602,191,360
10Jan 17, 2022 14:3627,302296,523,423226,604,78502,179,072
11Jan 17, 2022 14:3627,318253,476,737225,745,000998,0002,543,616
12Jan 17, 2022 14:3627,322253,192,807224,777,0001,998,0002,281,472