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 10, 2022 06:14Yuriy LyfenkoYuriy LyfenkoScore: 13,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2022 06:1413,798138,038,667114,524,00002,277,376
2Jan 10, 2022 06:1413,802140,509,359113,556,0001,004,0002,289,664
3Jan 10, 2022 06:1413,807139,583,499113,593,0001,005,0002,289,664
4Jan 10, 2022 06:1413,807140,959,930113,593,0001,005,0002,273,280
5Jan 10, 2022 06:1413,810144,824,499113,619,0001,005,0002,289,664
6Jan 10, 2022 06:1413,810142,529,700113,618,0001,005,0002,289,664
7Jan 10, 2022 06:1413,822140,632,805112,725,0001,995,0002,289,664
8Jan 10, 2022 06:1413,827144,746,267112,773,0001,995,0002,535,424
9Jan 10, 2022 06:1413,831140,337,083113,800,000998,0002,289,664
10Jan 10, 2022 06:1414,028175,172,225116,436,33302,269,184
11Jan 10, 2022 06:1414,030183,350,555116,450,35602,265,088
12Jan 10, 2022 06:1414,103172,092,113117,051,51602,273,280